Capacity-preserving subgraphs of directed flow networks (Q6182901)
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: Capacity-preserving subgraphs of directed flow networks |
scientific article; zbMATH DE number 7781733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Capacity-preserving subgraphs of directed flow networks |
scientific article; zbMATH DE number 7781733 |
Statements
Capacity-preserving subgraphs of directed flow networks (English)
0 references
22 December 2023
0 references
maximum flow
0 references
minimum equivalent digraph
0 references
series-parallel graphs
0 references
inapproximability
0 references
0 references
0.735170304775238
0 references
0.7279459238052368
0 references
