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
Parents
41
CUDA cuts: Fast graph cuts on the GPU
Vibhav Vineet, P. J. Narayanan · 2008 · 248 citations
A Scalable graph-cut algorithm for N-D grids
Andrew Delong, Yuri Boykov · 2008 · 108 citations
1–5 of 41
75
7
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 75
44
Stanford University
Stanford, United States
4 h-index
8 publications
628 citations
University of California, Berkeley
Berkeley, United States
3 h-index
5 publications
485 citations

University of British Columbia
Vancouver, Canada
2 h-index
2 publications
65 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
2 publications
26 citations
University of Bergen
Bergen, Norway
2 h-index
2 publications
35 citations

Western University
London, Canada
2 h-index
3 publications
4.8K citations

Central Economics and Mathematics Institute
Moscow, Russia
2 h-index
2 publications
428 citations
Simula Research Laboratory
Oslo, Norway
2 h-index
2 publications
35 citations
1–8 of 44
3 publications · 323 citations
3
h-index
TPAMI · 2 publications · 4.6K citations
2
h-index
JEA · 2 publications · 66 citations
2
h-index
2 publications · 52 citations
2
h-index
1 publications · 372 citations
1
h-index
1–5