The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs. We also present linear-time algorithms for finding Hamiltonian paths in these graphs.
机构:
Univ Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, Brazil
Bueno, Leticia R.
Faria, Luerbio
论文数: 0引用数: 0
h-index: 0
机构:
Univ Estado Rio de Janeiro, Fac Formacao Professores, Dept Matemat, BR-24435000 Sao Goncalo, RJ, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, Brazil
Faria, Luerbio
de Figueiredo, Celina M. H.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, Brazil
de Figueiredo, Celina M. H.
da Fonseca, Guilherme D.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, Brazil