Parallel Shortest Path Algorithms is a computational method designed to solve shortest path problems by exploiting concurrent execution across multiple processing units to accelerate computation relative to sequential approaches.
139
Publications
5.4K
Citations
306
Authors
162
Institutions
Publications per year
2017–2026
18
Publications
139
Parallel iterative search methods for vehicle routing problems
Éric D. Taillard · Networks · 1993 · 593 citations
Shortest‐path methods: Complexity, interrelations and new propositions
Stefano Pallottino · Networks · 1984 · 159 citations
1–5 of 139
Authors
306
- EC
5
h-index
- CZ
5
h-index
- KP
4
h-index
- UM
3
h-index
- VY
3
h-index
1–5 of 306
Institutions
162
Carnegie Mellon University
Pittsburgh, United States
6 h-index
8 publications
291 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
6 publications
245 citations
The University of Texas at Austin
Austin, United States
5 h-index
11 publications
318 citations
AT&T (United States)
Bedminster, United States
5 h-index
5 publications
249 citations
Duke University
Durham, United States
4 h-index
4 publications
107 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
8 publications
144 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
4 h-index
6 publications
113 citations
Max Planck Society
Munich, Germany
4 h-index
8 publications
214 citations
1–8 of 162
Venues
- Journal of Parallel and Distributed Computing
5 publications · 141 citations
5
h-index
- Algorithmica
5 publications · 103 citations
5
h-index
- Parallel Computing
5 publications · 182 citations
5
h-index
- Journal of Algorithms
4 publications · 198 citations
4
h-index
- Networks
3 publications · 789 citations
3
h-index
1–5