An effective algorithm for and phase transitions of the directed Hamiltonian cycle problem

DOI10.1613/JAIR.3109MaRDI QIDQ3067705zbMATH OpenOpenAlexWikidataFDO

Authors Gerold Jäger, Weixiong Zhang

Publication date 21 January 2011

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.3863

zbMATH Keywords

combinatorial problemsHamiltonian cycle problem (HCP)HCP in directed graphs (DHCP)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Abstract: The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, including phase transitions, of combinatorial problems. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, a limited amount of work has been done for the HCP in directed graphs (DHCP). The main 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. The second result of the current study is an experimental analysis of phase transitions of the DHCP, verifying and refining a known phase transition of the DHCP.

Recommendations

• A SAT based effective algorithm for the directed Hamiltonian cycle problem
• An algorithm for finding hamilton cycles in random directed graphs
• A successful algorithm for solving directed Hamiltonian path problems
• scientific article; zbMATH DE number 1249657
• A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem

Cited in

(9)

• scientific article; zbMATH DE number 1249657 (Why is no real title available?)
• A successful algorithm for solving directed Hamiltonian path problems
• A SAT based effective algorithm for the directed Hamiltonian cycle problem
• The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
• FHCP challenge set: the first set of structurally difficult instances of the Hamiltonian cycle problem
• SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
• Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One
• A space-efficient parameterized algorithm for the Hamiltonian Cycle problem by dynamic algebraization
• Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: An effective algorithm for and phase transitions of the directed Hamiltonian cycle problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3067705)