會議論文
| 學年 | 85 |
|---|---|
| 學期 | 2 |
| 發表日期 | 1997-04-28 |
| 作品名稱 | Finding hamiltonian cycles on incrementally extensible hypercube graphs |
| 作品名稱（其他語言） | |
| 著者 | Keh, Huan-chao; Chou, Po-yu; Lin, Jen-chih |
| 作品所屬單位 | 淡江大學資訊工程學系 |
| 出版者 | |
| 會議名稱 | High Performance Computing on the Information Superhighway, 1997. HPC Asia '97 |
| 會議地點 | Seoul, KOREA |
| 摘要 | The existence of a Hamiltonian cycle is the premise of usage in an interconnection network. A novel interconnection network, the incrementally extensible hypercube (IEH) graph, has been proposed. The IEH graphs are derived from hypercubes and also retain most of the properties of hypercubes. Unlike hypercubes without incremental extensibility, IEH graphs can be constructed in any number of nodes. In this paper, we present an algorithm to find a Hamiltonian cycle or path and prove that there exists a Hamiltonian cycle in all IEH graphs except for those containing exactly 2<sup>n</sup>-1 nodes. |
| 關鍵字 | |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | 19970428~19970502 |
| 通訊作者 | |
| 國別 | KOR |
| 公開徵稿 | Y |
| 出版型式 | |
| 出處 | Proceedings of high performance computing on the information superhighway. HPC Asia 97 Conference and Exhibition, pp.361-366 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/37678 ) |