Abstract
We present an algorithm for the Single Source Shortest Paths (SSSP) problem in directed H-minor free graphs. For every fixed H, if G is a graph with n vertices having integer edge lengths and s is a designated source vertex of G, the algorithm runs in O(n11.5-2logL)≤O(n1.392logL) time, where L is the absolute value of the smallest edge length. The algorithm computes the shortest paths and the distances from s to all vertices of the graph, or else provides a certificate that G is not H-minor free. Our result improves an earlier O(n1.5logL) time algorithm for this problem, which follows from a general SSSP algorithm of Goldberg.
Original language | English |
---|---|
Pages (from-to) | 3042-3047 |
Number of pages | 6 |
Journal | Theoretical Computer Science |
Volume | 411 |
Issue number | 34-36 |
DOIs | |
State | Published - 17 Jul 2010 |
Keywords
- H-minor free graphs
- Shortest paths
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)