English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49378/84106 (59%)
造訪人次 : 7373807      線上人數 : 76
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/37678

    題名: Finding hamiltonian cycles on incrementally extensible hypercube graphs
    作者: Keh, Huan-chao;Chou, Po-yu;Lin, Jen-chih
    貢獻者: 淡江大學資訊工程學系
    日期: 1997-04-28
    上傳時間: 2010-01-11 13:56:11 (UTC+8)
    摘要: 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.
    關聯: Proceedings of high performance computing on the information superhighway. HPC Asia 97 Conference and Exhibition, pp.361-366
    DOI: 10.1109/HPC.1997.592174
    顯示於類別:[資訊工程學系暨研究所] 會議論文


    檔案 描述 大小格式瀏覽次數
    Finding Hamiltonian Cycles on Incrementally Extensible Hypercube.pdf524KbAdobe PDF255檢視/開啟



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋