Exact algorithms for the Hamiltonian cycle problem in planar graphs

Authors:
Vladimir G. DeıNeko;Bettina Klinz;Gerhard J. Woeginger
Affiliations:
Warwick Business School, The University of Warwick, Coventry CV4 7AL, UK;Institut für Mathematik B, TU Graz, Steyrergasse 30, A-8010 Graz, Austria;Department of Mathematics and Computer Science, TU Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Operations Research Letters
Year:
2006

Citing 11
Cited 9

Finding small simple cycle separators for 2-connected planar graphs

Journal of Computer and System Sciences
Inclusion and exclusion algorithm for the Hamiltonian Path Problem

Information Processing Letters
A polynomial-time approximation scheme for weighted planar graph TSP

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Studies in computational geometry motivated by mesh generation

Studies in computational geometry motivated by mesh generation
On the existence of subexponential parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth

GD'04 Proceedings of the 12th international conference on Graph Drawing
Dynamic programming meets the principle of inclusion and exclusion

Operations Research Letters

Good triangulations yield good tours

Computers and Operations Research
Catalan structures and dynamic programming in H-minor-free graphs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
One sufficient condition and its applications for hamiltonian graph using its spanning subgraph

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Fast subexponential algorithm for non-local problems on graphs of bounded genus

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Catalan structures and dynamic programming in H-minor-free graphs

Journal of Computer and System Sciences
Exploiting planarity in separation routines for the symmetric traveling salesman problem

Discrete Optimization
Subexponential parameterized algorithms

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Fixed-parameter tractability for non-crossing spanning trees

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We construct an exact algorithm for the Hamiltonian cycle problem in planar graphs with worst case time complexity O(c^n), where c is some fixed constant that does not depend on the instance. Furthermore, we show that under the exponential time hypothesis, the time complexity cannot be improved to O(c^o^(^n^)).