Shortest Path Length
Shortest Path Length is a graph-theoretic metric that quantifies the minimum number of edges or the least cumulative weight along any path connecting two distinct nodes in a network.
474
Publications
23.8K
Citations
1.4K
Authors
595
Institutions
Publications per year
2017–2026
140
Parents
474
Finding the <i>K</i> Shortest Loopless Paths in a Network
Jin Y. Yen · Management Science · 1971 · 2.6K citations
Vincenzo Nicosia, Ginestra Bianconi, Vito Latora et al. · Physical Review Letters · 2013 · 321 citations · Full text
1–5 of 474
1.4K
5
h-index
5
h-index
5
h-index
5
h-index
4
h-index
1–5 of 1.4K
595
Georgia Institute of Technology
Atlanta, United States
8 h-index
13 publications
528 citations
Universidade de São Paulo
São Paulo, Brazil
8 h-index
27 publications
1.1K citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
10 publications
613 citations
Stony Brook University
Stony Brook, United States
7 h-index
9 publications
541 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
16 publications
601 citations

Chinese Academy of Sciences
Beijing, China
6 h-index
17 publications
1.2K citations

University of Shanghai for Science and Technology
Shanghai, China
6 h-index
7 publications
170 citations
Tsinghua University
Beijing, China
6 h-index
14 publications
513 citations
1–8 of 595
PRE · 13 publications · 472 citations
12
h-index
8 publications · 268 citations
8
h-index
8 publications · 378 citations
8
h-index
6 publications · 1.6K citations
6
h-index
6 publications · 145 citations
6
h-index
1–5