Sparsest cuts and concurrent flows in product graphs. (Q1427176)
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: Sparsest cuts and concurrent flows in product graphs. |
scientific article; zbMATH DE number 2055503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparsest cuts and concurrent flows in product graphs. |
scientific article; zbMATH DE number 2055503 |
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
0 references
0 references
0.9096607
0 references
0.90803504
0 references
0.88879323
0 references
0 references
0.8488008
0 references
0.84834176
0 references
0.8475805
0 references
0.8461108
0 references
