Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model

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

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 ◽

Cited By ~ 19

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

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs

10.1137/1.9781611977073.138 ◽

2022 ◽

pp. 3482-3495

Author(s):

Debarati Das ◽

Maximilian Probst Gutenberg ◽

Christian Wulff-Nilsen

Keyword(s):

Shortest Paths ◽

All Pairs Shortest Paths

Download Full-text

Developing the Parallelization Methods for Finding the All-Pairs Shortest Paths in Distributed Memory Architecture

2019 IEEE 38th International Performance Computing and Communications Conference (IPCCC) ◽

10.1109/ipccc47392.2019.8958713 ◽

2019 ◽

Author(s):

Mohammed Alghamdi ◽

Ligang He ◽

Yujue Zhou ◽

Junyu Li

Keyword(s):

Distributed Memory ◽

Shortest Paths ◽

Memory Architecture ◽

All Pairs Shortest Paths ◽

Distributed Memory Architecture

Download Full-text

Fully dynamic all pairs shortest paths with real edge weights

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2005.05.005 ◽

2006 ◽

Vol 72 (5) ◽

pp. 813-837 ◽

Cited By ~ 23

Author(s):

Camil Demetrescu ◽

Giuseppe F. Italiano

Keyword(s):

Shortest Paths ◽

All Pairs Shortest Paths

Download Full-text

Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model

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

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

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

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

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

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

From Circuit Complexity to Faster All-Pairs Shortest Paths

A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs

Developing the Parallelization Methods for Finding the All-Pairs Shortest Paths in Distributed Memory Architecture

Fully dynamic all pairs shortest paths with real edge weights

Export Citation Format