Shortest Path Trees
Shortest Path Trees is a directed tree structure that represents the collection of shortest paths from a single source vertex to all other reachable vertices in a weighted graph, where the path from the source to each vertex is uniquely determined by minimal cumulative edge weights.
155
Publications
7.9K
Citations
351
Authors
174
Institutions
Publications per year
2017–2026
21
Variants
Shortest Path Tree
Parents
155
Spanning trees and optimization problems
Choice Reviews Online · 2004 · 238 citations
Roman Dial, Fred Glover, D. Karney et al. · Networks · 1979 · 224 citations
1–5 of 155
351
4
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 351
174

University of L'Aquila
L’Aquila, Italy
5 h-index
12 publications
471 citations

Delft University of Technology
Delft, The Netherlands
5 h-index
11 publications
654 citations
University of Southern California
Los Angeles, United States
5 h-index
6 publications
377 citations

Sapienza University of Rome
Rome, Italy
5 h-index
13 publications
1.8K citations
University of Maryland, College Park
College Park, United States
4 h-index
5 publications
306 citations
Columbia University
New York, United States
4 h-index
4 publications
153 citations
University of Michigan
Ann Arbor, United States
4 h-index
6 publications
399 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
6 publications
258 citations
1–8 of 174
Repository · 4 publications · 121 citations
4
h-index
4 publications · 83 citations
4
h-index
4 publications · 311 citations
4
h-index
3 publications · 160 citations
3
h-index
PRE · 3 publications · 204 citations
3
h-index
1–5