A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs

SOFSEM 2012: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-27660-6_31 ◽

2012 ◽

pp. 373-384 ◽

Author(s):

Andrzej Lingas ◽

Dzmitry Sledneu

Keyword(s):

Shortest Paths ◽

Weighted Graphs ◽

Combinatorial Algorithm ◽

All Pairs Shortest Paths

Download Full-text

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

SIAM Journal on Computing ◽

10.1137/08071990x ◽

2010 ◽

Vol 39 (5) ◽

pp. 2075-2089 ◽

Author(s):

Timothy M. Chan

Keyword(s):

Shortest Paths ◽

Weighted Graphs ◽

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 ◽

Author(s):

Seth Pettie

Keyword(s):

Shortest Paths ◽

Weighted Graphs ◽

New Approach ◽

All Pairs Shortest Paths

Download Full-text

More algorithms for all-pairs shortest paths in weighted graphs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250877 ◽

2007 ◽

Author(s):

Timothy M. Chan

Keyword(s):

Shortest Paths ◽

Weighted Graphs ◽

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 ◽

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 ◽

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 ◽

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 ◽

Author(s):

Tomohiro Okuyama ◽

Fumihiko Ino ◽

Kenichi Hagihara

Keyword(s):

Parallel Algorithm ◽

Shortest Paths ◽

All Pairs Shortest Paths ◽

Download Full-text

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths

Journal of Algorithms ◽

10.1016/j.jalgor.2004.08.004 ◽

2007 ◽

Vol 62 (2) ◽

pp. 74-92 ◽

Author(s):

Surender Baswana ◽

Ramesh Hariharan ◽

Sandeep Sen

Keyword(s):

Transitive Closure ◽

Shortest Paths ◽

All Pairs Shortest Paths

Download Full-text

Average update times for fully-dynamic all-pairs shortest paths

Discrete Applied Mathematics ◽

10.1016/j.dam.2011.02.007 ◽

2011 ◽

Vol 159 (16) ◽

pp. 1751-1758

Author(s):

Tobias Friedrich ◽

Nils Hebbinghaus

Keyword(s):

Shortest Paths ◽

All Pairs Shortest Paths

Download Full-text

From Circuit Complexity to Faster All-Pairs Shortest Paths

SIAM Review ◽

10.1137/21m1418654 ◽

2021 ◽

Vol 63 (3) ◽

pp. 559-582

Author(s):

R. Ryan Williams

Keyword(s):

Shortest Paths ◽

Circuit Complexity ◽

All Pairs Shortest Paths

Download Full-text