2 papers
cs.DS2014
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
Sigve Hortemo Sæther
Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more g…
cs.DS2014
Between Treewidth and Clique-width
Sigve Hortemo Sæther, Jan Arne Telle
Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be…