Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter

DOI10.1007/978-3-319-14974-5_20zbMath1432.68196OpenAlexW2296960737MaRDI QIDQ5174964

Sigve Hortemo Sæther

Publication date: 19 February 2015

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-14974-5_20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Between treewidth and clique-width

This page was built for publication: Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter