A single source shortest path algorithm for graphs with separators
We show how to solve a single source shortest path problem on a planar network in time O(n3/2log n). The algorithm works for arbitrary edge weights (positive and negative) and is based on the planar separator theorem. More generally, the algorithm works in time O(na+blog n + n3a+ nd) on graphs G=(V, E) which have a separator of size na, have at most nb edges and where the separator can be found in time nd.
Unable to display preview. Download preview PDF.
- Bellman R.E. On a Routing Problem Quart. Appl. Math. 16 (1958) pp. 87–90Google Scholar
- Dijkstra E.W. A Note on two Problems in Connection with Graphs Num. Math. Vol. 1 (1959) pp. 269–271Google Scholar
- Edmonds J., Karp R.M. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems J. ACM 5 (1962) p. 345Google Scholar
- Lipton R., Tarjan R.E. A Separator Theorem for Planar Graphs Waterloo Conference on Theoretical Comp. Science Aug.77 pp. 1–10Google Scholar
- Floyd F.W. Algorithm 97: Shortest Path C. ACM 5 (1962) p. 345Google Scholar