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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LKH / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963317769 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.03019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time transformations between combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly-growing reductions of Karp's 21 NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-size Conversion of HCP to 3HCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for detecting non-Hamiltonicity in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:45, 13 July 2024

scientific article
Language Label Description Also known as
English
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
scientific article

    Statements

    Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (English)
    0 references
    0 references
    25 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    Sudoku
    0 references
    NP-completenes
    0 references
    reduction
    0 references
    Hamiltonian cycle problem
    0 references
    0 references
    0 references
    0 references
    0 references