A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem

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.

• Type: Conference
• Year: 2010
• Where: CSR
• Authors: Gerold Jäger, Weixiong Zhang
• Keywords: Algorithm, CSR 2010, Effective Algorithms, Hamiltonian Cycle Problem, Theoretical Computer Science