A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7559439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. |
scientific article; zbMATH DE number 7559439 |
Statements
18 July 2022
0 references
parameterized complexity
0 references
directed disjoint paths
0 references
congestion
0 references
dual parameterization
0 references
kernelization
0 references
directed tree-width
0 references
0 references
0 references
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (English)
0 references
