教師資料查詢 | 類別: 會議論文 | 教師: 葛煥昭KEH HUAN-CHAO (瀏覽個人網頁)

標題:Finding hamiltonian cycles on incrementally extensible hypercube graphs
學年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 2n-1 nodes.
關鍵字
語言英文
收錄於
會議性質國際
校內研討會地點
研討會時間19970428~19970502
通訊作者
國別韓國
公開徵稿Y
出版型式
出處Proceedings of high performance computing on the information superhighway. HPC Asia 97 Conference and Exhibition, pp.361-366
相關連結
SDGs
Google+ 推薦功能,讓全世界都能看到您的推薦!