Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms
Journal of Experimental Algorithmics (JEA)
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
EVEGA: an educational visulalization environment for graph algorithms
Proceedings of the 6th annual conference on Innovation and technology in computer science education
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Smooth Chan-Vese segmentation via graph cuts
Pattern Recognition Letters
| Hi-index | 0.00 |
We study efficient implementations of the push-relabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family of problems for which all known methods seem to have almost quadratic time growth rate.