The Partial Augment–Relabel Algorithm for the Maximum Flow Problem (0)

by A V Goldberg
Venue:In Proc. 16th Annual European Symposium Algorithms
Add To MetaCart
Results 1 - 1 of 1

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

by Andrew V. Goldberg
"... 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. 1 ..."
Abstract - Add to MetaCart
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. 1