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

Erik D. Demaine Mikhail Rudoy

Published in: CoRR (2017)

Keyphrases

grid points
neural network
graph matching
bipartite graph
series parallel
directed graph
voronoi diagram
data mining
graph theory
weighted graph
grid computing
grid environment
graph construction
computational grids