A new approach to all pairs shortest paths in planar graphs

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28398 ◽

1987 ◽

Cited By ~ 7

Author(s):

G. N. Frederickson

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

New Approach ◽

All Pairs Shortest Paths

Download Full-text

A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_269 ◽

1993 ◽

pp. 442-451 ◽

Cited By ~ 8

Author(s):

Philip N. Klein ◽

Sairam Subramanian

Keyword(s):

Planar Graphs ◽

Approximation Scheme ◽

Shortest Paths ◽

All Pairs Shortest Paths ◽

Dynamic Approximation

Download Full-text

A new approach to dynamic all pairs shortest paths

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780567 ◽

2003 ◽

Cited By ~ 33

Author(s):

Camil Demetrescu ◽

Giuseppe F. Italiano

Keyword(s):

Shortest Paths ◽

New Approach ◽

All Pairs Shortest Paths

Download Full-text

A new approach to dynamic all pairs shortest paths

Journal of the ACM ◽

10.1145/1039488.1039492 ◽

2004 ◽

Vol 51 (6) ◽

pp. 968-992 ◽

Cited By ~ 109

Author(s):

Camil Demetrescu ◽

Giuseppe F. Italiano

Keyword(s):

Shortest Paths ◽

New Approach ◽

All Pairs Shortest Paths

Download Full-text

A new approach to all-pairs shortest paths on real-weighted graphs

Theoretical Computer Science ◽

10.1016/s0304-3975(03)00402-x ◽

2004 ◽

Vol 312 (1) ◽

pp. 47-74 ◽

Cited By ~ 107

Author(s):

Seth Pettie

Keyword(s):

Shortest Paths ◽

Weighted Graphs ◽

New Approach ◽

All Pairs Shortest Paths

Download Full-text

All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) ◽

10.1109/sfcs.1998.743464 ◽

2002 ◽

Cited By ~ 12

Author(s):

U. Zwick

Keyword(s):

Directed Graphs ◽

Shortest Paths ◽

Exact Algorithms ◽

All Pairs Shortest Paths

Download Full-text

All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time

ACM Transactions on Algorithms ◽

10.1145/2344422.2344424 ◽

2012 ◽

Vol 8 (4) ◽

pp. 1-17 ◽

Cited By ~ 13

Author(s):

Timothy M. Chan

Keyword(s):

Shortest Paths ◽

Undirected Graphs ◽

All Pairs Shortest Paths

Download Full-text

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18 ◽

10.1145/3212734.3212773 ◽

2018 ◽

Cited By ~ 7

Author(s):

Udit Agarwal ◽

Vijaya Ramachandran ◽

Valerie King ◽

Matteo Pontecorvi

Keyword(s):

Distributed Algorithm ◽

Shortest Paths ◽

All Pairs Shortest Paths

Download Full-text

A Task Parallel Algorithm for Computing the Costs of All-Pairs Shortest Paths on the CUDA-Compatible GPU

2008 IEEE International Symposium on Parallel and Distributed Processing with Applications ◽

10.1109/ispa.2008.40 ◽

2008 ◽

Cited By ~ 10

Author(s):

Tomohiro Okuyama ◽

Fumihiko Ino ◽

Kenichi Hagihara

Keyword(s):

Parallel Algorithm ◽

Shortest Paths ◽

All Pairs Shortest Paths ◽

Task Parallel

Download Full-text

Shortest Paths in Planar Graphs with Negative Weight Edges

Encyclopedia of Algorithms ◽

10.1007/978-1-4939-2864-4_372 ◽

2016 ◽

pp. 1971-1974

Author(s):

Jittat Fakcharoenphol ◽

Satish Rao

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Negative Weight

Download Full-text

Shortest Paths in Planar Graphs with Negative Weight Edges

Encyclopedia of Algorithms ◽

10.1007/978-0-387-30162-4_372 ◽

2008 ◽

pp. 838-841

Author(s):

Jittat Fakcharoenphol ◽

Satish Rao

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Negative Weight

Download Full-text