The Hamiltonian Cycle Problem in Supergrid Graphs
碩士 === 朝陽科技大學 === 資訊工程系 === 103 === In this thesis, we first introduce a novel class of graphs, namely supergrid. Supergrid graphs include grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for grid graphs and triangular grid graphs were known to be NP-...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23276230083573472782 |