Shortest Path Problems
Shortest Path Problems is a fundamental optimization problem in network theory that seeks to determine the path between two nodes in a graph such that the sum of the weights of its constituent edges is minimized.
2.3K
Publications
167K
Citations
4.5K
Authors
1.4K
Institutions
Publications per year
2017–2026
394
Variants
Shortest Path Problem
2.3K
Robert W. Floyd · Communications of the ACM · 1962 · 4K citations · Full text
Richard Bellman · Quarterly of Applied Mathematics · 1958 · 2.7K citations · Full text
1–5 of 2.3K
4.5K
14
h-index
14
h-index
14
h-index
13
h-index
Massachusetts Institute of Technology, United States
13 publications · 1.7K citations
12
h-index
1–5 of 4.5K
1.4K
Massachusetts Institute of Technology
Cambridge, United States
41 h-index
82 publications
8.9K citations
University of California, Berkeley
Berkeley, United States
27 h-index
50 publications
7.8K citations
AT&T (United States)
Bedminster, United States
26 h-index
36 publications
7.9K citations

Tel Aviv University
Tel Aviv, Israel
26 h-index
64 publications
6K citations
The University of Texas at Austin
Austin, United States
23 h-index
52 publications
3.1K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
20 h-index
50 publications
4.4K citations

Centre National de la Recherche Scientifique
Paris, France
20 h-index
45 publications
1.6K citations

University of Waterloo
Waterloo, Canada
20 h-index
31 publications
1.8K citations
1–8 of 1.4K
103 publications · 11.8K citations
49
h-index
71 publications · 4.4K citations
37
h-index
53 publications · 3.6K citations
34
h-index
46 publications · 5.4K citations
32
h-index
43 publications · 6.7K citations
31
h-index
1–5