Exact Shortest Path Computation
Exact Shortest Path Computation is a shortest path algorithmic method that belongs to the class of deterministic computational techniques and is distinguished by its guarantee to find the optimal shortest path between nodes in a graph without approximation or error.
59
Publications
3.5K
Citations
127
Authors
77
Institutions
Publications per year
2017–2026
8
Parents
59
Exact Routing in Large Road Networks Using Contraction Hierarchies
Robert Geisberger, Peter Sanders, Dominik Schultes et al. · Transportation Science · 2012 · 319 citations · Full text
1–5 of 59
127
4
h-index
3
h-index
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 69 citations
2
h-index
2
h-index
1–5 of 127
77
The University of Tokyo
Tokyo, Japan
4 h-index
6 publications
938 citations
The University of Texas at Austin
Austin, United States
3 h-index
6 publications
236 citations
The University of Texas at Dallas
Richardson, United States
2 h-index
5 publications
123 citations
Universidad de Los Andes
Bogotá, Colombia
2 h-index
5 publications
525 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
2 h-index
5 publications
1.3K citations

University of Calabria
Rende, Italy
2 h-index
4 publications
460 citations
Korea Institute for Advanced Study
Seoul, South Korea
2 h-index
4 publications
72 citations

Bar-Ilan University
Ramat Gan, Israel
2 h-index
3 publications
33 citations
1–8 of 77
2 publications · 111 citations
2
h-index
Repository · 2 publications · 43 citations
2
h-index
2 publications · 281 citations
2
h-index
2 publications · 67 citations
2
h-index
Conference · 2 publications · 83 citations
2
h-index
1–5