Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Hamiltonian Paths in Some Classes of Grid Graphs

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • بيانات النشر:
      Hindawi Publishing Corporation, 2012.
    • الموضوع:
      2012
    • نبذة مختصرة :
      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 inL-alphabet,C-alphabet,F-alphabet, andE-alphabet grid graphs. We also present linear-time algorithms for finding Hamiltonian paths in these graphs.
    • File Description:
      text/xhtml; application/pdf
    • ISSN:
      1110-757X
    • الرقم المعرف:
      10.1155/2012/475087
    • Rights:
      OPEN
    • الرقم المعرف:
      edsair.doi.dedup.....1595b84fe7bc76a0c8172cac959568eb