The Hamiltonian Connectivity of L-shaped Supergrid Graphs
碩士 === 朝陽科技大學 === 資訊工程系 === 106 === Supergrid graphs are based on triangular grid graphs to add two possible feasible path (up-right and down-left). The Hamiltonian cycle and path problems for general supergrid graphs are known to be NP-complete. A graph is called Hamiltonian connected if it contain...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/6xz6g6 |