The Max-Flow Min-Cut theorem for countable networks (Q618031): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jctb.2010.08.002 / rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0911.4003 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5315023 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Menger's theorem for graphs containing no infinite paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5689024 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Menger's theorem for infinite graphs / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCTB.2010.08.002 / rank | |||
Normal rank | |||
Latest revision as of 22:18, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Max-Flow Min-Cut theorem for countable networks |
scientific article |
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
