Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions
- 1 January 1984
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 40 references indexed in Scilit:
- A weighted matroid intersection algorithmJournal of Algorithms, 1981
- Covering the edge set of a directed graph with treesDiscrete Mathematics, 1978
- A Minimax Theorem for Directed GraphsJournal of the London Mathematical Society, 1978
- MATROIDS AND SUBMODULAR FUNCTIONSThe Quarterly Journal of Mathematics, 1976
- Matroid intersection algorithmsMathematical Programming, 1975
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Network Flow and Systems of RepresentativesCanadian Journal of Mathematics, 1958
- A note on the maximum flow through a networkIEEE Transactions on Information Theory, 1956
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950