AbstractWe 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 requiringO(n4/3log(nL)) time, whereLis 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
AbstractAn algorithm is presented for finding a single source shortest path tree in a planar undirec...
We present a simple parallel algorithm for the {\em single-source shortest path problem} in {\em pla...
In this paper we give an O~((nm)^(2/3) log C) time algorithm for computing min-cost flow (or min-cos...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
AbstractIn this paper, we present an O(nlog3n) time algorithm for finding shortest paths in an n-nod...
We study the maximum $s,t$-flow oracle problem on planar directed graphs where the goal is to design...
Let G be an n-node simple directed planar graph with nonnegative edge weights. We study the fundamen...
AbstractWe propose data structures for maintaining shortest paths in planar graphs in which the weig...
We consider the following problem: Given an n-vertex undirected planar-embedded graph with a simple ...
AbstractLetG=(V,A) be a directed, planar graph, lets,t∈V,s≠t, and letca>0 be the capacity of an arca...
Abstract. Minimum cuts have been closely related to shortest paths in planar graphs via planar duali...
We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positiv...
Let $G$ be a directed planar graph of complexity~$n$, each arc having a nonnegative length. Let ...
In this dissertation we describe several algorithms for computing flows, connectivity, and disjoint ...
We give an O(n1.5 logn) time algorithm for finding the maximum flow in a directed planar graph with ...
AbstractAn algorithm is presented for finding a single source shortest path tree in a planar undirec...
We present a simple parallel algorithm for the {\em single-source shortest path problem} in {\em pla...
In this paper we give an O~((nm)^(2/3) log C) time algorithm for computing min-cost flow (or min-cos...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
AbstractIn this paper, we present an O(nlog3n) time algorithm for finding shortest paths in an n-nod...
We study the maximum $s,t$-flow oracle problem on planar directed graphs where the goal is to design...
Let G be an n-node simple directed planar graph with nonnegative edge weights. We study the fundamen...
AbstractWe propose data structures for maintaining shortest paths in planar graphs in which the weig...
We consider the following problem: Given an n-vertex undirected planar-embedded graph with a simple ...
AbstractLetG=(V,A) be a directed, planar graph, lets,t∈V,s≠t, and letca>0 be the capacity of an arca...
Abstract. Minimum cuts have been closely related to shortest paths in planar graphs via planar duali...
We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positiv...
Let $G$ be a directed planar graph of complexity~$n$, each arc having a nonnegative length. Let ...
In this dissertation we describe several algorithms for computing flows, connectivity, and disjoint ...
We give an O(n1.5 logn) time algorithm for finding the maximum flow in a directed planar graph with ...
AbstractAn algorithm is presented for finding a single source shortest path tree in a planar undirec...
We present a simple parallel algorithm for the {\em single-source shortest path problem} in {\em pla...
In this paper we give an O~((nm)^(2/3) log C) time algorithm for computing min-cost flow (or min-cos...