Taming the knight's tour: minimizing turns and crossings (Q2067620): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205882584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2902418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link watchman tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the link length of rectilinear spanning paths in grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which Rectangular Chessboards Have a Knight's Tour? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which chessboards have a closed knight's tour within the cube? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which chessboards have a closed knight's tour within the rectangular prism? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The closed knight tour problem in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the knight's Hamiltonian path problem on chessboards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of knight's tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for finding Hamilton paths and Knight's tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised knight's tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the Knight's tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for constructing knight's tours on arbitrary \(n\times m\) chessboards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3317138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knight's Tours on a Torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3263912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized knight's tours on rectangular chessboards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429520 / rank
 
Normal rank

Latest revision as of 18:45, 27 July 2024

scientific article
Language Label Description Also known as
English
Taming the knight's tour: minimizing turns and crossings
scientific article

    Statements

    Taming the knight's tour: minimizing turns and crossings (English)
    0 references
    0 references
    18 January 2022
    0 references
    0 references
    graph drawing
    0 references
    chess
    0 references
    Hamiltonian cycle
    0 references
    approximation algorithms
    0 references
    0 references