Two-Level Push-Relabel Algorithm for the Maximum Flow Problem

Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bipartite flows. Experiments show that the algorithm performs well on several problem families.

• Type: Conference
• Year: 2009
• Where: AAIM
• Authors: Andrew V. Goldberg
• Keywords: AAIM 2009, Algorithm, Algorithms, Maximum flow Problem, Two-level Push-relabel Algorithm