Push-relabel Algorithms

Push-Relabel Algorithms is a class of efficient network flow algorithms that compute maximum flow by maintaining a preflow and iteratively pushing excess flow toward the sink while relabeling vertices to ensure progress, differing from augmenting-path methods by decoupling the operations of flow advancement and path discovery.

41

Publications

6.6K

Citations

75

Authors

44

Institutions

Publications per year

2017–2026

2

Variants

Push-relabel Algorithm

Authors

75

  1. AV
    Andrew V. Goldberg

    Stanford University, United States

    7 publications · 576 citations

    7

    h-index

  2. SI
    Satoru Iwata

    The University of Tokyo, Japan

    3 publications · 225 citations

    3

    h-index

  3. BH
    Bo Hong

    Georgia Institute of Technology, United States

    3 publications · 72 citations

    3

    h-index

  4. DS
    Dorit S. Hochbaum

    University of California, Berkeley, United States

    3 publications · 284 citations

    3

    h-index

  5. SP
    Serge Plotkin

    Stanford University, United States

    2 publications · 81 citations

    2

    h-index

1–5 of 75

Venues

  1. Operations Research

    3 publications · 323 citations

    3

    h-index

  2. 2

    h-index

  3. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 66 citations

    2

    h-index

  4. Journal of Algorithms

    2 publications · 52 citations

    2

    h-index

  5. Algorithmica

    1 publications · 372 citations

    1

    h-index

1–5