Add to ORKGWe give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes. The best previ-ously known algorithm requires O(n log3 n) time and O(n logn) space.
We describe algorithms for finding shortest paths and distances in a planar digraph which exploit th...
Given a plane undirected graph G with non-negative edge weights and a set of k terminal pairs on the...
AbstractWe consider the problem of finding the shortest distance between all pairs of vertices in a ...
Abstract. We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph wi...
AbstractIn this paper, we present an O(nlog3n) time algorithm for finding shortest paths in an n-nod...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
Abstract. An algorithm is presented. for generating a succinct encoding of all pairs shor-test path ...
AbstractWe propose data structures for maintaining shortest paths in planar graphs in which the weig...
Let G be an n-node simple directed planar graph with nonnegative edge weights. We study the fundamen...
The shortest circular-path problem is similar to the ordinary shortest path problem, but instead of ...
We describe algorithms for finding shortest paths and distances in outerplanar and planar digraphs t...
We present new and improved data structures that answer exact node-to-node distance queries in plana...
We present a simple exact distance oracle for the point-to-point shortest distance problem in planar...
AbstractWe generalize the linear-time shortest-paths algorithm for planar graphs with nonnegative ed...
We describe algorithms for finding shortest paths and distances in a planar digraph which exploit th...
We describe algorithms for finding shortest paths and distances in a planar digraph which exploit th...
Given a plane undirected graph G with non-negative edge weights and a set of k terminal pairs on the...
AbstractWe consider the problem of finding the shortest distance between all pairs of vertices in a ...
Abstract. We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph wi...
AbstractIn this paper, we present an O(nlog3n) time algorithm for finding shortest paths in an n-nod...
AbstractWe give a linear-time algorithm for single-source shortest paths in planar graphs with nonne...
Abstract. An algorithm is presented. for generating a succinct encoding of all pairs shor-test path ...
AbstractWe propose data structures for maintaining shortest paths in planar graphs in which the weig...
Let G be an n-node simple directed planar graph with nonnegative edge weights. We study the fundamen...
The shortest circular-path problem is similar to the ordinary shortest path problem, but instead of ...
We describe algorithms for finding shortest paths and distances in outerplanar and planar digraphs t...
We present new and improved data structures that answer exact node-to-node distance queries in plana...
We present a simple exact distance oracle for the point-to-point shortest distance problem in planar...
AbstractWe generalize the linear-time shortest-paths algorithm for planar graphs with nonnegative ed...
We describe algorithms for finding shortest paths and distances in a planar digraph which exploit th...
We describe algorithms for finding shortest paths and distances in a planar digraph which exploit th...
Given a plane undirected graph G with non-negative edge weights and a set of k terminal pairs on the...
AbstractWe consider the problem of finding the shortest distance between all pairs of vertices in a ...