淡江大學機構典藏:Item 987654321/37678
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3888706      在线人数 : 585
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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 PDF400检视/开启
    index.html0KbHTML290检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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