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

Authors

831

  1. JP
    Jung-Heum Park

    Catholic University of Korea, South Korea

    15 publications · 465 citations

    13

    h-index

  2. KK
    Keiichi Kaneko

    Tokyo University of Agriculture and Technology, Japan

    15 publications · 313 citations

    12

    h-index

  3. KK
    Ken‐ichi Kawarabayashi

    National Institute of Informatics, Japan

    12 publications · 520 citations

    11

    h-index

  4. PS
    Paul Seymour

    Princeton University, United States

    10 publications · 2.2K citations

    10

    h-index

  5. SK
    Sanjeev Khanna

    University of Pennsylvania, United States

    10 publications · 709 citations

    10

    h-index

1–5 of 831

Venues

  1. SIAM Journal on Computing

    18 publications · 934 citations

    15

    h-index

  2. Networks

    16 publications · 2K citations

    14

    h-index

  3. Theoretical Computer Science

    17 publications · 646 citations

    13

    h-index

  4. Journal of Combinatorial Theory Series B

    13 publications · 2.4K citations

    12

    h-index

  5. SIAM Journal on Discrete Mathematics

    12 publications · 334 citations

    11

    h-index

1–5