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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8254643082618713
0 references
0.7293520569801331
0 references
0.7270411849021912
0 references
0.7269009947776794
0 references
