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

Authors

766

  1. KK
    Keiichi Kaneko

    Tokyo University of Agriculture and Technology, Japan

    16 publications · 330 citations

    13

    h-index

  2. AB
    Antoine Bossard

    Tokyo University of Agriculture and Technology, Japan

    6 publications · 99 citations

    6

    h-index

  3. BN
    Bijendra N. Jain

    Indian Institute of Technology Delhi, India

    5 publications · 77 citations

    5

    h-index

  4. XL
    Xuefei Li

    Wuhan University, China

    5 publications · 274 citations

    5

    h-index

  5. LC
    Laurie Cuthbert

    Queen Mary University of London, United Kingdom

    5 publications · 274 citations

    5

    h-index

1–5 of 766

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 15 publications · 681 citations

    13

    h-index

  2. IEICE Transactions on Information and Systems

    10 publications · 233 citations

    10

    h-index

  3. IEEE Transactions on Computers

    10 publications · 706 citations

    10

    h-index

  4. Networks

    9 publications · 865 citations

    9

    h-index

  5. IEEE/ACM Transactions on Networking

    TON · 6 publications · 327 citations

    6

    h-index

1–5