Computer Science ›› 2007, Vol. 34 ›› Issue (9): 176-180.
Previous Articles Next Articles
WEN Xue-Lian, LOU Ding-Jun, LU Yun-Ting, LIANG Hua-Jin （Department of Gomputer Science, Sun Yat-sen University, Guangzhou 510275）
Online:
Published:
Abstract: Finding the Hamilton path with minimum cost between two arbitrary given distinct vertices in a weighted graph, OHP for short, is a well known algorithm problem and has wide application in network routing and many aspects of computer science. OHP is NP com
Key words: Hamiltonian path, NP complete, Halin graph, Fan
WEN Xue-Lian, LOU Ding-Jun, LU Yun-Ting, LIANG Hua-Jin （Department of Gomputer Science, Sun Yat-sen University, Guangzhou 510275）. [J].Computer Science, 2007, 34(9): 176-180.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2007/V34/I9/176
Cited
Home