Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Henk G. Meijer / rank
Normal rank
 
Property / author
 
Property / author: Henk G. Meijer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2008.11.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005353392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for b-matchings: An alternative approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Covering Tours with Turn Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Snowblower Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for lawn mowing and milling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two New Classes of Hamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Path of Superlogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-unfoldings of simplicial manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths and cycles of superpolylogarithmic length / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound for the TSP in cubic 3-edge-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier analysis and large independent sets in powers of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of triangular grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3621130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two geometric problems related to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Distances One and Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Hamiltonian Cycles in Bipartite Graphs / rank
 
Normal rank

Latest revision as of 20:43, 1 July 2024

scientific article
Language Label Description Also known as
English
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
scientific article

    Statements

    Not being (super)thin or solid is hard: A study of grid Hamiltonicity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamiltonian cycle
    0 references
    grid graph
    0 references
    high-girth graph
    0 references
    covering tour
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references