A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds-Reference-Cited by-同舟云学术

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

Published:2018-07-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Agarwal Udit¹,Ramachandran Vijaya¹,King Valerie²,Pontecorvi Matteo³

Affiliation:

1. University of Texas at Austin, Austin, TX, USA

2. University of Victoria, Victoria, BC, Canada

3. Nokia Bell Labs, Nozay, France

Funder

Natural Sciences and Engineering Research Council of Canada

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3212734.3212773

Reference22 articles.

1. Udit Agarwal and Vijaya Ramachandran . 2018. A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. (2018). Manuscript. Udit Agarwal and Vijaya Ramachandran . 2018. A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. (2018). Manuscript.

2. Richard Bellman . 1958. On a routing problem. Quarterly of applied mathematics Vol. 16 1 (1958) 87--90. Richard Bellman . 1958. On a routing problem. Quarterly of applied mathematics Vol. 16 1 (1958) 87--90.

3. Michael Elkin . 2017. Distributed exact shortest paths in sublinear time Proc. STOC. ACM 757--770. 10.1145/3055399.3055452 Michael Elkin . 2017. Distributed exact shortest paths in sublinear time Proc. STOC. ACM 757--770. 10.1145/3055399.3055452

4. Michael Elkin and Ofer Neiman . 2016. Hopsets with constant hopbound and applications to approximate shortest paths Proc. FOCS. IEEE 128--137. Michael Elkin and Ofer Neiman . 2016. Hopsets with constant hopbound and applications to approximate shortest paths Proc. FOCS. IEEE 128--137.

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

2. Minor Sparsifiers and the Distributed Laplacian Paradigm;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

3. Single-source shortest paths in the CONGEST model with improved bounds;Distributed Computing;2021-11-27

4. Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time;SIAM Journal on Computing;2021-11-23

5. Smaller Cuts, Higher Lower Bounds;ACM Transactions on Algorithms;2021-10-31