Faster Shortest-Path Algorithms for Planar Graphs

Abstract

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we give an algorithm requiring O(n 4Â3 log(nL)) time, where L is the absolute value of the most negative length. This algorithm can be used to obtain similar bounds for computing a feasible flow in a planar network, for finding a perfect matching in a planar bipartite graph, and for finding a maximum flow in a planar graph when the source and sink are not on the same face. We also give parallel and dynamic versions of these algorithms. ] 1997 Academic Press

Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs

“…The recursive subdivision that Henzinger et al [14] require can then be obtained using the division by Eppstein in the first level and then continue in each planar subpiece using their approach Djidjev [4] and Fakcharoenphol and Rao [11] (slightly improved by Klein [17] for nonnegative edge-lengths) describe data structures for shortest path queries in planar graphs. We will need the following special case.…”

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

“…We would like to note that faster sequential SSSP algorithms exist for special graph classes with arbitrary nonnegative edge weights, e.g., there is a linear-time approach for planar graphs [41]. The algorithm uses graph decompositions based on separators that may have size up to O(n 1−ε ).…”

Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs

“…As noted by Henzinger et al [HKRS97], strongly sublinear separators obtain λ-divisions with total excess εn for λ = poly(1/ε). Such divisions were first used by Frederickson in planar graphs [Fre87].…”