The complexity of finding arc-disjoint branching flows (Q298947)
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: The complexity of finding arc-disjoint branching flows |
scientific article; zbMATH DE number 6595943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding arc-disjoint branching flows |
scientific article; zbMATH DE number 6595943 |
Statements
The complexity of finding arc-disjoint branching flows (English)
0 references
21 June 2016
0 references
disjoint branchings
0 references
branching flow
0 references
polynomial algorithm
0 references
NP-completeness
0 references
0.8682820200920105
0 references
0.8074502348899841
0 references
0.8009790182113647
0 references
0.7883012294769287
0 references
0.7878614068031311
0 references
