A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975)
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: A relaxation of the directed disjoint paths problem: a global congestion metric helps |
scientific article; zbMATH DE number 7437226
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relaxation of the directed disjoint paths problem: a global congestion metric helps |
scientific article; zbMATH DE number 7437226 |
Statements
A relaxation of the directed disjoint paths problem: a global congestion metric helps (English)
0 references
1 December 2021
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
0 references
