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

Authors

351

  1. DF
    Daniele Frigioni

    University of L'Aquila, Italy

    4 publications · 294 citations

    4

    h-index

  2. KC
    Kun‐Mao Chao

    National Taiwan University, Taiwan

    4 publications · 84 citations

    4

    h-index

  3. GP
    Guido Proietti

    University of L'Aquila, Italy

    4 publications · 129 citations

    4

    h-index

  4. PV
    Piet Van Mieghem

    Delft University of Technology, Netherlands

    4 publications · 233 citations

    4

    h-index

  5. AC
    Aaron Clauset

    Santa Fe Institute, United States

    3 publications · 288 citations

    3

    h-index

1–5 of 351

Venues

  1. arXiv (Cornell University)

    Repository · 4 publications · 121 citations

    4

    h-index

  2. European Journal of Operational Research

    4 publications · 83 citations

    4

    h-index

  3. Networks

    4 publications · 311 citations

    4

    h-index

  4. Algorithmica

    3 publications · 160 citations

    3

    h-index

  5. Physical Review E

    PRE · 3 publications · 204 citations

    3

    h-index

1–5