Internally disjoint paths in a variant of the hypercube

被引：0
作者：
机构：
[1] Department of Computer Science, National Chiao Tung University
[2] Department of Information Management, Minghsin University of Science and Technology
来源：
Chen, Y.-C. (jmtan@cs.nctu.edu.tw) | 2013年 / Springer Science and Business Media Deutschland GmbH卷 / 20期
关键词：
Diameter; Disjoint paths; Exchanged hypercube; Hypercube; Wide diameter;
D O I：
10.1007/978-3-642-35452-6_11
中图分类号：
学科分类号：
摘要：
The hypercube is one of the most popular interconnection networks for parallel computer/communication system. The exchanged hypercube, which is a variant of the hypercube, maintains several desirable properties of the hypercube such as low diameter, bipancyclicity, and super connectivity. In this paper, we give internally disjoint paths for parallel routing in exchanged hypercubes and show the wide diameter of exchanged hypercubes. © Springer-Verlag Berlin Heidelberg 2013.
引用
收藏
页码：89 / 96
页数：7
相关论文
共 50 条
  • [31] Shortest node-to-node disjoint paths algorithm for symmetric networks
    Almansouri, Hesham
    Hussain, Zaid
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (04): : 4347 - 4360
  • [32] Disjoint paths in hypercubes with prescribed origins and lengths
    Choudum, S. A.
    Lavanya, S.
    Sunitha, V.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2010, 87 (08) : 1692 - 1708
  • [33] Disjoint paths, planarizing cycles, and spanning walks
    Yu, XX
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1997, 349 (04) : 1333 - 1358
  • [34] Multiflows and disjoint paths of minimum total cost
    Alexander V. Karzanov
    Mathematical Programming, 1997, 78 : 219 - 242
  • [35] On Finding Min-Min Disjoint Paths
    Guo, Longkun
    Shen, Hong
    ALGORITHMICA, 2013, 66 (03) : 641 - 653
  • [36] A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
    Yossi Azar
    Uriel Feige
    Daniel Glasner
    Algorithmica, 2010, 57 : 517 - 537
  • [37] The undirected two disjoint shortest paths problem
    Gottschau, Marinus
    Kaiser, Marcus
    Waldmann, Clara
    OPERATIONS RESEARCH LETTERS, 2019, 47 (01) : 70 - 75
  • [38] THE TURÁN NUMBER OF THREE DISJOINT PATHS
    Deng, Jinghua
    Hou, Jianfeng
    Zeng, Qinghou
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (04) : 1513 - 1537
  • [39] Efficient algorithms for computing disjoint QoS paths
    Orda, A
    Sprintson, A
    IEEE INFOCOM 2004: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2004, : 727 - 738
  • [40] Set-to-Set Disjoint Paths in Tori
    Kaneko, Keiichi
    Bossard, Antoine
    2016 FOURTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2016, : 91 - 97
12345