Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions

DOI10.1007/s00453-009-9296-1zbMath1200.05223WikidataQ59567665 ScholiaQ59567665MaRDI QIDQ1957653

Hans L. Bodlaender, Fedor V. Fomin, Frederic Dorn, Eelko Penninkx

Publication date: 27 September 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/22177

zbMATH Keywords

Hamiltonian cycle; Traveling salesman problem; Planar graphs; Treewidth; Branchwidth; Exact and parameterized algorithms

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C45: Eulerian and Hamiltonian graphs