Chinese remainder encoding for Hamiltonian cycles

DOI10.1007/978-3-030-80223-3_15OpenAlexW3186789547MaRDI QIDQ2118300

Marijn J. H. Heule

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Cites Work

• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• SAT problems with chains of dependent variables
• Cyclic Hamiltonian cycle systems of the complete graph.
• Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• Answer Set Programming Modulo Acyclicity
• Shift Register Sequences – A Retrospective Account
• Formalizing Dangerous SAT Encodings
• Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
• FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem

This page was built for publication: Chinese remainder encoding for Hamiltonian cycles