Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- 1 April 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 19 (2), 248-264
- https://doi.org/10.1145/321694.321699
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- On a Class of Capacitated Transportation ProblemsManagement Science, 1959