Submodular Flows
- 1 January 1984
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A weighted matroid intersection algorithmJournal of Algorithms, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- How to make a digraph strongly connectedCombinatorica, 1981
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- A generalization of max flow—min cutMathematical Programming, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972