Chinese Remainder Encoding for Hamiltonian Cycles-Reference-Cited by-同舟云学术

Chinese Remainder Encoding for Hamiltonian Cycles

Published:2021 Issue: Volume: Page:216-224
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2021
language:
Short-container-title:

Author:

Heule Marijn J. H.^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-80223-3_15

Reference14 articles.

1. Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., Schaub, T.: Answer set programming modulo acyclicity. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) Logic Programming and Nonmonotonic Reasoning. pp. 143–150. Springer International Publishing (2015)

2. Buratti, M., Del Fra, A.: Cyclic Hamiltonian cycle systems of the complete graph. Discrete Mathematics 279(1), 107–119 (2004), in Honour of Zhu Lie

3. Chiba, N., Nishizeki, T.: The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. Journal of Algorithms 10(2), 187–211 (1989)

4. Gent, I.P.: Arc consistency in SAT. In: Proceedings of the 15th European Conference on Artificial Intelligence. p. 121–125. ECAI’02, IOS Press, NLD (2002)

5. Golomb, S.W.: Shift Register Sequences. Aegean Park Press (1982)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proof Logging for the Circuit Constraint;Lecture Notes in Computer Science;2024

2. Hamiltonian Cycle Reconfiguration with Answer Set Programming;Logics in Artificial Intelligence;2023

3. Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat;Electronic Proceedings in Theoretical Computer Science;2021-09-17