An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network (Q2850152)
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: An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network |
scientific article; zbMATH DE number 6212385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network |
scientific article; zbMATH DE number 6212385 |
Statements
26 September 2013
0 references
An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network (English)
0 references
0.7747563123703003
0 references
