Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159): Difference between revisions

@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time transformations between combinatorial problems
+Normal rank
@@ Property / cites work @@
+The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
+Normal rank
@@ Property / cites work @@
+Linearly-growing reductions of Karp's 21 NP-complete problems
+Normal rank
@@ Property / cites work @@
+A Linear-size Conversion of HCP to 3HCP
@@ Property / cites work: A Linear-size Conversion of HCP to 3HCP / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem
+Normal rank
@@ Property / cites work @@
+An effective implementation of the Lin-Kernighan traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
+Normal rank
@@ Property / cites work @@
+A new heuristic for detecting non-Hamiltonicity in cubic graphs
+Normal rank
@@ Property / cites work @@
+There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
+Normal rank