The power of cut-based parameters for computing edge-disjoint paths (Q2659778)
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 power of cut-based parameters for computing edge-disjoint paths |
scientific article; zbMATH DE number 7328490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The power of cut-based parameters for computing edge-disjoint paths |
scientific article; zbMATH DE number 7328490 |
Statements
The power of cut-based parameters for computing edge-disjoint paths (English)
0 references
26 March 2021
0 references
edge-disjoint path problem
0 references
feedback edge set
0 references
tree-cut width
0 references
parameterized complexity
0 references
0 references
0.9923552870750428
0 references
0.8660109639167786
0 references
0.798054039478302
0 references
0.7971042990684509
0 references
