The power of cut-based parameters for computing edge disjoint paths (Q2301542): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3134833166 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:34, 19 March 2024
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
