The decision of Hamiltonian path in Mesh
碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 96 === The essence of this thesis is to study the Hamiltonian path over a given mesh graph. The problem of solving Hamiltonian path is known as an NP-complete problem, and it is hard to handle in mathematics. The mesh is a special type of graph. All the edge of a m...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/hgpss4 |