Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6256115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time algorithms for special cases of the maximum confluent flow problem |
scientific article; zbMATH DE number 6256115 |
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
0.9300570487976074
0 references
0.8525764346122742
0 references
0.8491999506950378
0 references
0.8464943170547485
0 references
0.8432353138923645
0 references
