Chinese remainder encoding for Hamiltonian cycles

DOI10.1007/978-3-030-80223-3_15MaRDI QIDQ2118300zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Answer set programming modulo acyclicity
• Change ringing and Hamiltonian cycles: the search for Erin and Stedman triples
• Cyclic Hamiltonian cycle systems of the complete graph.
• FHCP challenge set: the first set of structurally difficult instances of the Hamiltonian cycle problem
• Formalizing Dangerous SAT Encodings
• Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• SAT problems with chains of dependent variables
• Shift Register Sequences – A Retrospective Account
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs

Cited in

(3)

• scientific article; zbMATH DE number 2114065 (Why is no real title available?)
• Hamiltonian cycle reconfiguration with answer set programming
• Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs

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

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