ON THE COMPLEXITY AND APPROXIMABILITY OF SOME HAMILTONIAN PATH PROBLEMS
博士 === 國立清華大學 === 資訊工程學系 === 88 === This dissertation studies the oldest areas of inquiry in graph theory. The hamiltonian path problem, for a given graph, is to find a path to traverse each vertex exactly. For a general graph, it has been shown that this problem is NP-complete and it is widely be...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/37214285826670311768 |