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.
CITATION STYLE
Mehlhorn, K., & Schmidt, B. H. (1983). A single source shortest path algorithm for graphs with separators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 158 LNCS, pp. 302–309). Springer Verlag. https://doi.org/10.1007/3-540-12689-9_113
Mendeley helps you to discover research relevant for your work.