Disjoint Paths Problem
The Disjoint Paths Problem is a fundamental computational problem in network flow theory that seeks to determine whether a given directed or undirected graph contains a set of vertex-disjoint or edge-disjoint paths connecting specified source-sink pairs, thereby distinguishing it from general path-finding problems by enforcing strict non-overlapping constraints on the routes.
481
Publications
22.2K
Citations
831
Authors
439
Institutions
Publications per year
2017–2026
53
Parents
481
A quick method for finding shortest pairs of disjoint paths
J. W. Suurballe, Robert E. Tarjan · Networks · 1984 · 693 citations
J. W. Suurballe · Networks · 1974 · 689 citations
1–5 of 481
831
13
h-index
12
h-index
11
h-index
10
h-index
10
h-index
1–5 of 831
439
Catholic University of Korea
Seoul, South Korea
13 h-index
15 publications
465 citations

Tokyo University of Agriculture and Technology
Tokyo, Japan
12 h-index
21 publications
355 citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
17 publications
1.2K citations

National Institute of Informatics
Tokyo, Japan
11 h-index
12 publications
476 citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
19 publications
825 citations

Cornell University
Ithaca, United States
11 h-index
16 publications
802 citations
Princeton University
Princeton, United States
10 h-index
12 publications
673 citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
21 publications
1K citations
1–8 of 439
18 publications · 934 citations
15
h-index
16 publications · 2K citations
14
h-index
17 publications · 646 citations
13
h-index
13 publications · 2.4K citations
12
h-index
12 publications · 334 citations
11
h-index
1–5