An Algorithm for Submodular Functions on Graphs
- 1 January 1982
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 8 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
- Minimal cost flows in regular matroidsPublished by Springer Nature ,1981
- On the orientation of graphsJournal of Combinatorial Theory, Series B, 1980
- On two minimax theorems in graphJournal of Combinatorial Theory, Series B, 1976
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Some recent applications of the theory of linear inequalities to extremal combinatorial analysisProceedings of Symposia in Applied Mathematics, 1960