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 条
  • [21] Planar Disjoint-Paths Completion
    Isolde Adler
    Stavros G. Kolliopoulos
    Dimitrios M. Thilikos
    Algorithmica, 2016, 76 : 401 - 425
  • [22] Planar Disjoint-Paths Completion
    Adler, Isolde
    Kolliopoulos, Stavros G.
    Thilikos, Dimitrios M.
    ALGORITHMICA, 2016, 76 (02) : 401 - 425
  • [23] CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
    Gewali, Laxmi P.
    Mazzella, Dan
    Selvaraj, Henry
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2009, 8 (02) : 141 - 154
  • [24] Finding Disjoint Paths in Split Graphs
    Pinar Heggernes
    Pim van ’t Hof
    Erik Jan van Leeuwen
    Reza Saei
    Theory of Computing Systems, 2015, 57 : 140 - 159
  • [25] Computing monotone disjoint paths on polytopes
    Avis, David
    Kaluzny, Bohdan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2008, 16 (04) : 328 - 343
  • [26] On shortest disjoint paths in planar graphs
    Kobayashi, Yusuke
    Sommer, Christian
    DISCRETE OPTIMIZATION, 2010, 7 (04) : 234 - 245
  • [27] Construction of vertex-disjoint paths in alternating group networks
    Zhou, Shuming
    Xiao, Wenjun
    Parhami, Behrooz
    JOURNAL OF SUPERCOMPUTING, 2010, 54 (02) : 206 - 228
  • [28] Constructing one-to-many disjoint paths in folded hypercubes
    Lai, CN
    Chen, GH
    Duh, DR
    IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (01) : 33 - 45
  • [29] Many-to-many disjoint paths in hypercubes with faulty vertices
    Li, Xiang Jun
    Liu, Bin
    Ma, Meijie
    Xu, Jun-Ming
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 229 - 242
  • [30] On the number of edges in a graph with many two-hop disjoint paths
    Takayama, Koki
    Kobayashi, Yusuke
    DISCRETE APPLIED MATHEMATICS, 2020, 283 : 718 - 723
12345