Many-to-many disjoint paths in faulty hypercubes

被引：68
|
作者：
Chen, Xie-Bin [1 ]
机构：
[1] Zhangzhou Teachers Coll, Dept Math & Informat Sci, Zhangzhou 363000, Fujian, Peoples R China
来源：
INFORMATION SCIENCES | 2009年 / 179卷 / 18期
基金：
中国国家自然科学基金;
关键词：
Hypercube; Disjoint paths; Fault-tolerance; Hamiltonian path; Parallel computing; PRESCRIBED EDGES; BIPANCYCLICITY; CYCLES; PARTITIONS; COVERS;
D O I：
10.1016/j.ins.2009.05.006
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper considers the problem of many-to-many disjoint paths in the hypercube Q(n) with f(v) faulty vertices and f(e) faulty edges, and obtains the following result. For any integer k with 1 <= k <= n - 1, any two sets S and T of k fault-free vertices in different parts, if f(v) + f(e) <= n - k - 1, then there exist k disjoint fault-free (S, T)-paths in Q(n) which contains at least 2(n) - 2f(v) vertices. This result is optimal in the worst case. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码：3110 / 3115
页数：6
相关论文
共 50 条
  • [21] The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networks
    Niu, Ruichao
    Xu, Min
    THEORETICAL COMPUTER SCIENCE, 2022, 911 : 26 - 40
  • [22] Paired many-to-many disjoint path covers of hypertori
    Kronenthal, Brian G.
    Wong, Wing Hong Tony
    DISCRETE APPLIED MATHEMATICS, 2017, 218 : 14 - 20
  • [23] On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
    Park, Jung-Heum
    Kim, Hee-Chul
    Lim, Hyeong-Seok
    2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8, 2008, : 71 - +
  • [24] Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
    Dybizbanski, Janusz
    Szepietowski, Andrzej
    INFORMATION PROCESSING LETTERS, 2021, 172 (172)
  • [25] The maximum number of disjoint paths in faulty enhanced hypercubes
    Liu, Hongmei
    Jin, Dan
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2019, 108 : 99 - 112
  • [26] Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
    Li, Jing
    Melekian, Chris
    Zuo, Shurong
    Cheng, Eddie
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2020, 31 (03) : 371 - 383
  • [27] An efficient construction of one-to-many node-disjoint paths in folded hypercubes
    Lai, Cheng-Nan
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (04) : 2310 - 2316
  • [28] Paired Many-to-Many 2-Disjoint Path Covers in Meshes
    Keshavarz-Kohjerdi, Fatemeh
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2024, 35 (10) : 1854 - 1866
  • [29] Computing Many-to-Many Shortest Paths Using Highway Hierarchies
    Knopp, Sebastian
    Sanders, Peter
    Schultes, Dominik
    Schulz, Frank
    Wagner, Dorothea
    PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 36 - +
  • [30] Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
    Cheng, Dongqin
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 219 - 224
12345