ویراساینس.
سند علمی

Hamilton Paths in Grid Graphs

Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter

چکیده

A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two intervals. Given a rectangular grid graph and two of its nodes, we give necessary and sufficient conditions for the graph to have a Hamilton path between these two nodes. In contrast, the Hamilton path (and circuit) problem for general grid graphs is shown to be NP-complete. This provides a new, relatively simple, proof of the result that the Euclidean traveling salesman problem is NP-complete.

اسناد مشابه

  • Hamilton Paths in Certain Arithmetic Graphs

    سند علمی۲۰۰۵Ars Comb.Paul A. Russell

    For each integer m ≥ 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x − m or y = mx or y = x/m. Our aim in this note is to show that, for each m, the graph Gm contains a Hamilton

  • Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs

    سند علمی۲۰۱۷CoRRErik D. Demaine, Mikhail Rudoy

    In 2007, Arkin et al. [3] initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these proble

  • Bent Hamilton Cycles in d-Dimensional Grid Graphs

    سند علمی۲۰۰۳Electr. J. Comb.Frank Ruskey, Joe Sawada

    A bent Hamilton cycle in a grid graph is one in which each edge in a successive pair of edges lies in a different dimension. We show that the d-dimensional grid graph has a bent Hamilton cycle if some dimension is even and d ≥ 3, and does not have a bent Hamilton cycle if all dim

  • Bent Hamilton Cy les in d-Dimensional Grid Graphs

    سند علمی۲۰۰۱F. Ruskey, Joe Sawada

    F. Ruskey Joe Sawada y May 15, 2002 Abstra t A bent Hamilton y le in a grid graph is one in whi h ea h edge in a su essive pair of edges lies in a di erent dimension. We show that the d-dimensional grid graph has a bent Hamilton y le if some dimension is even and d 3, and does no

  • Hamiltonian Paths in C-shaped Grid Graphs

    سند علمی۲۰۱۶CoRRFatemeh Keshavarz-Kohjerdi, Alireza Bagheri

    One of the well-known NP-complete problems in graph theory is the Hamiltonian path problem; i.e., finding a simple path in the graph such that every vertex visits exactly once [5]. The two-dimensional integer grid G is an infinite undirected graph in which vertices are all points

  • Hamilton Circuits in Hexagonal Grid Graphs

    سند علمی۲۰۰۷CCCGKamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport

    We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid points of a regular hexagonal tiling of the plane and edges corresponding to hexagon sides. We show t