The power of cut-based parameters for computing edge disjoint paths (Q2301542)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The power of cut-based parameters for computing edge disjoint paths |
scientific article |
Statements
The power of cut-based parameters for computing edge disjoint paths (English)
0 references
24 February 2020
0 references
Edge Disjoint Path problem
0 references
feedback edge set
0 references
treecut width
0 references
parameterized complexity
0 references
