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

Authors

1.5K

  1. KK
    Keiichi Kaneko

    Tokyo University of Agriculture and Technology, Japan

    17 publications · 342 citations

    13

    h-index

  2. JC
    Julia Chuzhoy

    Toyota Technological Institute at Chicago, United States

    11 publications · 352 citations

    11

    h-index

  3. JP
    Jung-Heum Park

    Catholic University of Korea, South Korea

    11 publications · 372 citations

    10

    h-index

  4. FB
    F. Bruce Shepherd

    McGill University, Canada

    10 publications · 530 citations

    10

    h-index

  5. KK
    Ken‐ichi Kawarabayashi

    National Institute of Informatics, Japan

    10 publications · 487 citations

    10

    h-index

1–5 of 1.5K

Venues

  1. Networks

    30 publications · 2.4K citations

    20

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 18 publications · 750 citations

    16

    h-index

  3. IEEE/ACM Transactions on Networking

    TON · 15 publications · 844 citations

    15

    h-index

  4. SIAM Journal on Computing

    19 publications · 766 citations

    15

    h-index

  5. SIAM Journal on Discrete Mathematics

    21 publications · 642 citations

    14

    h-index

1–5