JOURNAL ARTICLE
Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
Aaron BernsteinDanupon Nanongkai
Year: 2021 Journal: SIAM Journal on Computing Vol: 52 (2)Pages: STOC19-112 Publisher: Society for Industrial and Applied Mathematics
Abstract
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 16 January 2020Accepted: 19 July 2021Published online: 23 November 2021Keywordsdistributed algorithms, CONGEST, all-pairs shortest paths, graph algorithmsAMS Subject Headings68W15, 05C85, 05C12Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat
Keywords:
Computer science Randomized algorithm Graph Time complexity Floyd–Warshall algorithm Shortest path problem Combinatorics Theoretical computer science Mathematics Algorithm Dijkstra's algorithm
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
33
Refs
0.21
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Optimization and Search Problems
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Distributed Weighted All Pairs Shortest Paths Through Pipelining
Udit AgarwalVijaya Ramachandran
Year: 2019 Pages: 23-32
JOURNAL ARTICLE
Decremental all-pairs shortest paths in deterministic near-linear time
Year: 2021 Pages: 626-639
JOURNAL ARTICLE
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^{5/4}) Rounds
Chien‐Chung HuangDanupon NanongkaiThatchaphol Saranurak
Year: 2017 Pages: 168-179
JOURNAL ARTICLE
All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms
Year: 2002 Pages: 310-319
JOURNAL ARTICLE
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
Udit AgarwalVijaya RamachandranValerie KingMatteo Pontecorvi
Year: 2018 Pages: 199-205