Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497)
From MaRDI portal
(Redirected from Item:Q2921444)
 | 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: Turing kernelization for finding long paths and cycles in restricted graph classes |
scientific article; zbMATH DE number 6352781
- Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Turing kernelization for finding long paths and cycles in restricted graph classes |
scientific article; zbMATH DE number 6352781 |
|
Statements
Turing kernelization for finding long paths and cycles in restricted graph classes (English)
0 references
Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes (English)
0 references
28 December 2016
0 references
8 October 2014
0 references
parameterized complexity
0 references
Turing kernelization
0 references
\(k\)-Path
0 references
preprocessing
0 references
0 references
0 references
0.9367767572402954
0 references
0.8595260381698608
0 references
0.7844216823577881
0 references
