Algorithmic results for potential‐based flows: Easy and hard cases (Q5226171)
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: Algorithmic results for potential‐based flows: Easy and hard cases |
scientific article; zbMATH DE number 7087273
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic results for potential‐based flows: Easy and hard cases |
scientific article; zbMATH DE number 7087273 |
Statements
Algorithmic results for potential‐based flows: Easy and hard cases (English)
0 references
30 July 2019
0 references
maximum flow problem
0 references
network reduction
0 references
NP-hardness
0 references
potential-based flows
0 references
potential networks
0 references
series-parallel graphs
0 references
0.87096715
0 references
0.87096715
0 references
0.8661105
0 references
0.8568967
0 references
0.8524926
0 references
0.8524926
0 references
0.8490584
0 references
0.84787726
0 references
0.8478703
0 references
0.84635997
0 references
