Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
From MaRDI portal
Publication:504159
DOI10.1016/j.akcej.2016.10.001zbMath1354.05018arXiv1603.03019OpenAlexW2963317769MaRDI QIDQ504159
Publication date: 25 January 2017
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.03019
Paths and cycles (05C38) Orthogonal arrays, Latin squares, Room squares (05B15) Eulerian and Hamiltonian graphs (05C45)
Uses Software
Cites Work
- Unnamed Item
- A new heuristic for detecting non-Hamiltonicity in cubic graphs
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
- Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Linearly-growing reductions of Karp's 21 NP-complete problems
- There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
- A Linear-size Conversion of HCP to 3HCP
- Linear time transformations between combinatorial problems
- Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
This page was built for publication: Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
