Sparsest cuts and concurrent flows in product graphs. (Q1427176): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:52, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparsest cuts and concurrent flows in product graphs. |
scientific article |
Statements
Sparsest cuts and concurrent flows in product graphs. (English)
0 references
14 March 2004
0 references
Product graph
0 references
Sparsest cut
0 references
Concurrent flow
0 references
Bottleneck graph
0 references
