Path-cycle Decomposition

Path-Cycle Decomposition is a method in network flow theory that decomposes a flow into a sum of path flows and cycle flows, distinguishing itself by uniquely representing any feasible flow as a non-negative combination of simple paths from source to sink and directed cycles in the network.

40

Publications

1.3K

Citations

59

Authors

42

Institutions

Publications per year

2017–2026

2

Authors

59

  1. NJ
    Nicholas J. Cavenagh

    The University of Queensland, Australia

    4 publications · 119 citations

    4

    h-index

  2. EJ
    Elizabeth J. Billington

    The University of Queensland, Australia

    4 publications · 98 citations

    4

    h-index

  3. BA
    Brian Alspach

    Simon Fraser University, Canada

    3 publications · 326 citations

    3

    h-index

  4. CA
    C. A. Rodger

    Auburn University, United States

    3 publications · 42 citations

    3

    h-index

  5. GF
    Genghua Fan

    Fuzhou University, China

    3 publications · 124 citations

    3

    h-index

1–5 of 59

Venues

  1. Discrete Mathematics

    11 publications · 202 citations

    11

    h-index

  2. Journal of Combinatorial Theory Series B

    5 publications · 410 citations

    5

    h-index

  3. Journal of Combinatorial Theory Series A

    5 publications · 120 citations

    5

    h-index

  4. Graphs and Combinatorics

    4 publications · 102 citations

    4

    h-index

  5. ArXiv.org

    Repository · 1 publications · 13 citations

    1

    h-index

1–5