The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate |
scientific article; zbMATH DE number 984963
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate |
scientific article; zbMATH DE number 984963 |
Statements
The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (English)
0 references
28 February 1997
0 references