Shortest Path Enumeration
Shortest Path Enumeration is a computational method in graph theory that systematically generates all optimal paths between specified nodes in a network, distinguished from related algorithms by its focus on exhaustive identification rather than singular path determination.
55
Publications
3.5K
Citations
107
Authors
69
Institutions
Publications per year
2017–2026
6
Parents
55
Finding the <i>k</i> shortest simple paths
John Hershberger, Matthew Maxel, Subhash Suri · ACM Transactions on Algorithms · 2007 · 190 citations
1–5 of 55
107
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 107
69

University of Minnesota
Minneapolis, United States
3 h-index
4 publications
446 citations
George Mason University
Fairfax, United States
2 h-index
2 publications
206 citations

University of Wisconsin–Platteville
Platteville, United States
2 h-index
2 publications
33 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
4 publications
486 citations
University of Chicago
Chicago, United States
2 h-index
2 publications
42 citations

Indian Institute of Technology Roorkee
Roorkee, India
2 h-index
3 publications
38 citations
The University of Texas at Dallas
Richardson, United States
2 h-index
2 publications
79 citations

Naval Postgraduate School
Monterey, United States
2 h-index
4 publications
272 citations
1–8 of 69
4 publications · 294 citations
4
h-index
3 publications · 352 citations
3
h-index
3 publications · 44 citations
3
h-index
2 publications · 24 citations
2
h-index
TRR · 2 publications · 243 citations
2
h-index
1–5