Disjoint Paths
Disjoint Paths is a network routing construct defined as a set of two or more paths between a given source and destination pair in a network that share no common edges (edge-disjoint) or no common intermediate nodes (node-disjoint), ensuring redundancy and enhanced reliability in the event of link or node failures.
762
Publications
33.2K
Citations
1.5K
Authors
659
Institutions
Publications per year
2017–2026
82
Parents
762
Split multipath routing with maximally disjoint paths in ad hoc networks
S.-J. Lee, Mário Gerla · 2002 · 1.2K citations
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 762
1.5K
13
h-index
Toyota Technological Institute at Chicago, United States
11 publications · 352 citations
11
h-index
10
h-index
10
h-index
10
h-index
1–5 of 1.5K
659
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
24 publications
1.7K citations

Tokyo University of Agriculture and Technology
Tokyo, Japan
12 h-index
23 publications
381 citations

Cornell University
Ithaca, United States
12 h-index
17 publications
877 citations
Technion – Israel Institute of Technology
Haifa, Israel
12 h-index
26 publications
1.1K citations
Princeton University
Princeton, United States
12 h-index
17 publications
384 citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
16 publications
960 citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
12 publications
336 citations
Nokia (United States)
Coppell, United States
10 h-index
18 publications
792 citations
1–8 of 659
30 publications · 2.4K citations
20
h-index
TPDS · 18 publications · 750 citations
16
h-index
TON · 15 publications · 844 citations
15
h-index
19 publications · 766 citations
15
h-index
21 publications · 642 citations
14
h-index
1–5