A SAT based effective algorithm for the directed hamiltonian cycle problem

Authors:
Gerold Jäger;Weixiong Zhang
Affiliations:
Computer Science Institute, Christian-Albrechts-University of Kiel, Kiel, Germany;Department of Computer Science/Department of Genetics, Washington University, St. Louis, Missouri, United States
Venue:
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Year:
2010

Citing 14
Cited 0

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
An algorithm for finding Hamilton paths and cycles in random graphs

Combinatorica - Theory of Computing
Finding Hamilton cycles in sparse random graphs

Journal of Combinatorial Theory Series A
An algorithm for finding Hamilton cycles in random directed graphs

Journal of Algorithms
Updating the Hamiltonian problem—a survey

Journal of Graph Theory
Bounds on the number of knight's tours

Discrete Applied Mathematics
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph

ACM Transactions on Mathematical Software (TOMS)
Positional games on random graphs

Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
Efficient haplotype inference with boolean satisfiability

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Tolerance based contract-or-patch heuristic for the asymmetric TSP

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Efficient conflict analysis for finding all satisfying assignments of a boolean circuit

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, little is known for the HCP in directed graphs (DHCP). The contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the Assignment Problem (AP) and utilizes a technique based on Boolean satisfiability (SAT). By combining effective algorithms for the AP and SAT, our algorithm significantly outperforms previous exact DHCP algorithms including an algorithm based on the award-winning Concorde TSP algorithm.