Shortest Paths
Shortest Paths is a fundamental graph-theoretic construct in geometric graphs that identifies the minimum-length path between two vertices, where the length is measured as the sum of Euclidean edge weights along the path.
3.1K
Publications
204.3K
Citations
6.6K
Authors
1.9K
Institutions
Publications per year
2017–2026
637
Variants
Shortest Path
3.1K
cytoHubba: identifying hub objects and sub-networks from complex interactome
Chia-Hao Chin, Shu-Hwa Chen, Hsin-Hung Wu et al. · BMC Systems Biology · 2014 · 6.8K citations · Full text
Finding the <i>K</i> Shortest Loopless Paths in a Network
Jin Y. Yen · Management Science · 1971 · 2.6K citations
1–5 of 3.1K
6.6K
17
h-index
16
h-index
16
h-index
16
h-index
15
h-index
1–5 of 6.6K
1.9K
Massachusetts Institute of Technology
Cambridge, United States
37 h-index
99 publications
9K citations
Stanford University
Stanford, United States
35 h-index
85 publications
10.7K citations
AT&T (United States)
Bedminster, United States
29 h-index
52 publications
5.8K citations

Tel Aviv University
Tel Aviv, Israel
29 h-index
84 publications
5.3K citations
University of California, Berkeley
Berkeley, United States
27 h-index
54 publications
7.8K citations

Centre National de la Recherche Scientifique
Paris, France
25 h-index
68 publications
5.8K citations
University of Illinois Urbana-Champaign
Urbana, United States
22 h-index
52 publications
4.5K citations

Sapienza University of Rome
Rome, Italy
22 h-index
57 publications
3.2K citations
1–8 of 1.9K
58 publications · 6.9K citations
38
h-index
75 publications · 5.9K citations
36
h-index
33 publications · 1.7K citations
23
h-index
29 publications · 2.3K citations
23
h-index
JACM · 24 publications · 7.1K citations
21
h-index
1–5