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 条
  • [1] Disjoint paths in the enhanced hypercube with a faulty subgraph
    Ma, Meijie
    Guo, Chaoming
    Li, Xiang-Jun
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2023, 69 (02) : 1343 - 1354
  • [2] Disjoint paths in the enhanced hypercube with a faulty subgraph
    Meijie Ma
    Chaoming Guo
    Xiang-Jun Li
    Journal of Applied Mathematics and Computing, 2023, 69 : 1343 - 1354
  • [3] Node-disjoint paths in hierarchical hypercube networks
    Wu, Ruei-Yu
    Chen, Gen-Huey
    Kuo, Yu-Liang
    Chang, Gerard J.
    INFORMATION SCIENCES, 2007, 177 (19) : 4200 - 4207
  • [4] A Hypercube Variant with Small Diameter
    Zhu, Xuding
    JOURNAL OF GRAPH THEORY, 2017, 85 (03) : 651 - 660
  • [5] Disjoint paths in tournaments
    Chudnovsky, Maria
    Scott, Alex
    Seymour, Paul
    ADVANCES IN MATHEMATICS, 2015, 270 : 582 - 597
  • [6] Short disjoint paths in locally connected graphs
    Chen, Chuanping
    Cada, Roman
    Kaiser, Tomas
    Ryjacek, Zdenek
    GRAPHS AND COMBINATORICS, 2007, 23 (05) : 509 - 519
  • [7] Short Disjoint Paths in Locally Connected Graphs
    Chuanping Chen
    Roman Čada
    Tomáš Kaiser
    Zdeněk Ryjáček
    Graphs and Combinatorics, 2007, 23 : 509 - 519
  • [8] Disjoint paths in unions of tournaments
    Chudnovsky, Maria
    Scott, Alex
    Seymour, Paul
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 135 : 238 - 255
  • [9] Disjoint paths in symmetric digraphs
    Jarry, A.
    Perennes, S.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (01) : 90 - 97
  • [10] Reliability Analysis for Disjoint Paths
    Inoue, Takeru
    IEEE TRANSACTIONS ON RELIABILITY, 2019, 68 (03) : 985 - 998
12345