The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate
Author:
- 1 August 1995
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 148 (1) , 165-170
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Data Structures and Network Algorithms1983
- Graph algorithmsComputer-Aided Design, 1980
- Book Review: Combinatorial optimization: networks and matroidsBulletin of the American Mathematical Society, 1978