arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.10046cs.CCcs.CG
收藏

Hamilton性在细网格图或多边形网格图中是困难的,但在细多边形网格图中是容易的

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

Erik D. Demaine, Mikhail Rudoy

摘要:

在2007年,Arkin等人开始系统地研究正方形、三角形或六边形网格图上的哈密顿循环问题的复杂性,这些网格图仅限于多边形、薄网格、超薄网格、度有界网格或实心网格图。他们解决了这些问题的许多组合,证明它们是多项式可解的或NP完全的,但留下了三个组合。在本文中,我们证明了其中两个未解的组合是NP-完全的:正方形多边形网格图的哈密尔顿性和非均匀细网格图的哈密尔顿性。我们还考虑了一个新的限制,网格图是薄的和多边形,并证明了哈密尔顿性,然后成为多项式可解的正方形,三角形和六边形网格图。

英文摘要:

In 2007, Arkin et al. 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 problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we prove two of these unsolved combinations to be NP-complete: Hamiltonicity of Square Polygonal Grid Graphs and Hamiltonicity of Hexagonal Thin Grid Graphs. We also consider a new restriction, where the grid graph is both thin and polygonal, and prove that Hamiltonicity then becomes polynomially solvable for square, triangular, and hexagonal grid graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑