Chinese remainder encoding for Hamiltonian cycles

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

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

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

Cited In (3)

• Title not available (Why is that?)
• Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
• Hamiltonian cycle reconfiguration with answer set programming

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)