Distributed Shortest Path Algorithms
Distributed Shortest Path Algorithms is a computational framework in graph theory that solves shortest path problems by coordinating multiple autonomous processing nodes, each with localized knowledge of the network, to collectively compute optimal routes without relying on a central authority.
135
Publications
6.8K
Citations
278
Authors
153
Institutions
Publications per year
2017–2026
32
Parents
135
Reachability and Distance Queries via 2-Hop Labels
Edith Cohen, Eran Halperin, Haim Kaplan et al. · SIAM Journal on Computing · 2003 · 508 citations
Distributed dynamic programming
Dimitri P. Bertsekas · IEEE Transactions on Automatic Control · 1982 · 218 citations
1–5 of 135
278
6
h-index
University of California, Santa Cruz, United States
6 publications · 292 citations
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 278
153
SRI International
Menlo Park, United States
10 h-index
15 publications
973 citations
ETH Zurich
Zurich, Switzerland
7 h-index
12 publications
566 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
9 publications
693 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
8 publications
168 citations
Menlo School
Atherton, United States
6 h-index
9 publications
684 citations

Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
594 citations
University of California, Berkeley
Berkeley, United States
4 h-index
8 publications
289 citations
Virginia Tech
Blacksburg, United States
4 h-index
5 publications
181 citations
1–8 of 153
5 publications · 370 citations
5
h-index
Repository · 4 publications · 65 citations
4
h-index
3 publications · 558 citations
3
h-index
3 publications · 243 citations
3
h-index
3 publications · 261 citations
3
h-index
1–5