The Max-Flow Min-Cut theorem for countable networks (Q618031)
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 Max-Flow Min-Cut theorem for countable networks |
scientific article; zbMATH DE number 5836651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Max-Flow Min-Cut theorem for countable networks |
scientific article; zbMATH DE number 5836651 |
Statements
The Max-Flow Min-Cut theorem for countable networks (English)
0 references
14 January 2011
0 references
infinite graphs
0 references
flows
0 references
networks
0 references
Max-Flow Min-Cut
0 references
ends of graphs
0 references
0.8215954899787903
0 references
0.806340217590332
0 references
0.7972172498703003
0 references
0.7888155579566956
0 references
