Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithms for special cases of the maximum confluent flow problem |
scientific article |
Statements
Polynomial-time algorithms for special cases of the maximum confluent flow problem (English)
0 references
7 February 2014
0 references
confluent flow
0 references
outerplanar graph
0 references
polynomial-time algorithm
0 references
treewidth
0 references
FPTAS
0 references
0 references
