An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121)
From MaRDI portal
(Redirected from Item:Q5920098)
| 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: An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width |
scientific article; zbMATH DE number 6778701
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width |
scientific article; zbMATH DE number 6778701 |
Statements
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (English)
0 references
14 April 2020
0 references
22 September 2017
0 references
Hamiltonian cycle
0 references
Eulerian trail
0 references
clique-width
0 references
XP-algorithm
0 references
edge dominating sets
0 references
exponential time hypothesis
0 references
0 references
0 references
0 references
0.9613057971000672
0 references
0.7782483696937561
0 references