Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
SIAM Journal on Discrete Mathematics
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
LexBFS-Orderings and Power of Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Multiple-source shortest paths in planar graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast and simple approximation of the diameter and radius of a graph
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present a (1+ε)-approximation algorithm running in O(f(ε) ·n log4n) time for finding the diameter of an undirected planar graph with n vertices and with non-negative edge lengths.