Scaling algorithms for network problems
Journal of Computer and System Sciences
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
Analysis of preflow push algorithms for maximum network flow
SIAM Journal on Computing
A faster deterministic maximum flow algorithm
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing
An efficient cost scaling algorithm for the assignment problem
Mathematical Programming: Series A and B
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Recent Developments in Maximum Flow Algorithms (Invited Lecture)
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient preflow push algorithms
Computers and Operations Research
The Partial Augment---Relabel Algorithm for the Maximum Flow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Experimental evaluation of parametric max-flow algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
An efficient graph cut algorithm for computer vision problems
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Maximum flows by incremental breadth-first search
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.00 |
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.