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

Authors

107

  1. PC
    Peng Chen

    Tongji University, China

    2 publications · 56 citations

    2

    h-index

  2. SZ
    Shanjiang Zhu

    George Mason University, United States

    2 publications · 206 citations

    2

    h-index

  3. GF
    Gang Feng

    City University of Hong Kong, Hong Kong SAR China

    2 publications · 33 citations

    2

    h-index

  4. SB
    Shlomo Bekhor

    Technion – Israel Institute of Technology, Israel

    2 publications · 243 citations

    2

    h-index

  5. CG
    Carlo Giacomo Prato

    Technical University of Denmark, Denmark

    2 publications · 243 citations

    2

    h-index

1–5 of 107

Venues

  1. Networks

    4 publications · 294 citations

    4

    h-index

  2. European Journal of Operational Research

    3 publications · 352 citations

    3

    h-index

  3. Microelectronics Reliability

    3 publications · 44 citations

    3

    h-index

  4. Discrete Mathematics

    2 publications · 24 citations

    2

    h-index

  5. 2

    h-index

1–5