On the complexity of finding internally vertex-disjoint long directed paths (Q6830376)
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 7166189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding internally vertex-disjoint long directed paths |
scientific article; zbMATH DE number 7166189 |
Statements
On the complexity of finding internally vertex-disjoint long directed paths (English)
0 references
12 February 2020
0 references
digraph subdivision
0 references
spindle
0 references
parameterized complexity
0 references
FPT algorithm
0 references
representative family
0 references
complexity dichotomy
0 references
