The complexity of finding arc-disjoint branching flows (Q298947): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.10.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2181756921 / rank | |||
Normal rank | |||
Revision as of 19:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding arc-disjoint branching flows |
scientific article |
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
