The Hamilton circuit problem on grids

DOI10.1051/ita/1994280605671zbMath0884.68097OpenAlexW96684974MaRDI QIDQ4365024

Foto N. Afrati

Publication date: 30 October 1997

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92494

zbMATH Keywords

grid graphsHamilton circuit problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole ⋮ Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time ⋮ Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ Hamiltonian paths in \(L\)-shaped grid graphs

Cites Work

• Parallel algorithms for finding Hamilton cycles in random graphs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• Hamilton Paths in Grid Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item