A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs
- 6 June 2001
- Vol. 37 (4) , 171-193
- https://doi.org/10.1002/net.1012
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Instant recognition of half integrality and 2-approximationsPublished by Springer Nature ,1998
- A simple min-cut algorithmJournal of the ACM, 1997
- A new approach to the minimum cut problemJournal of the ACM, 1996
- A Faster Deterministic Maximum Flow AlgorithmJournal of Algorithms, 1994
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A theorem on flows in networksPacific Journal of Mathematics, 1957