English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52068/87197 (60%)
Visitors : 8906067      Online Users : 305
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/37678

    Title: Finding hamiltonian cycles on incrementally extensible hypercube graphs
    Authors: Keh, Huan-chao;Chou, Po-yu;Lin, Jen-chih
    Contributors: 淡江大學資訊工程學系
    Date: 1997-04-28
    Issue Date: 2010-01-11 13:56:11 (UTC+8)
    Abstract: 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.
    Relation: Proceedings of high performance computing on the information superhighway. HPC Asia 97 Conference and Exhibition, pp.361-366
    DOI: 10.1109/HPC.1997.592174
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    Finding Hamiltonian Cycles on Incrementally Extensible Hypercube.pdf524KbAdobe PDF282View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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