Node-disjoint Paths
Node-Disjoint Paths is a network flow construct in which a set of paths between two vertices in a graph are mutually non-overlapping in terms of intermediate nodes, meaning no two paths share any vertex except possibly the source and sink.
358
Publications
15.1K
Citations
766
Authors
397
Institutions
Publications per year
2017–2026
29
358
1–5 of 358
766
13
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 766
397

Tokyo University of Agriculture and Technology
Tokyo, Japan
12 h-index
21 publications
357 citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
11 publications
422 citations
Nokia (United States)
Coppell, United States
7 h-index
12 publications
630 citations
Indian Institute of Technology Delhi
New Delhi, India
5 h-index
8 publications
125 citations
University at Buffalo, State University of New York
Buffalo, United States
5 h-index
9 publications
555 citations
University of California, Santa Barbara
Santa Barbara, United States
5 h-index
6 publications
119 citations
The Ohio State University
Columbus, United States
4 h-index
7 publications
3K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
7 publications
1.4K citations
1–8 of 397
TPDS · 15 publications · 681 citations
13
h-index
10 publications · 233 citations
10
h-index
10 publications · 706 citations
10
h-index
9 publications · 865 citations
9
h-index
TON · 6 publications · 327 citations
6
h-index
1–5