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 条
  • [1] Many-to-many disjoint paths in hypercubes with faulty vertices
    Li, Xiang Jun
    Liu, Bin
    Ma, Meijie
    Xu, Jun-Ming
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 217 : 229 - 242
  • [2] Paired many-to-many disjoint path covers in faulty hypercubes
    Jo, Shinhaeng
    Park, Jung-Heum
    Chwa, Kyung-Yong
    [J]. THEORETICAL COMPUTER SCIENCE, 2013, 513 : 1 - 24
  • [3] Paired many-to-many disjoint path covers of hypercubes with faulty edges
    Chen, Xie-Bin
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (03) : 61 - 66
  • [4] Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges
    Huazhong Lü
    [J]. The Journal of Supercomputing, 2019, 75 : 400 - 424
  • [5] Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges
    Lu, Huazhong
    [J]. JOURNAL OF SUPERCOMPUTING, 2019, 75 (01): : 400 - 424
  • [6] Paired many-to-many disjoint path covers of the hypercubes
    Chen, Xie-Bin
    [J]. INFORMATION SCIENCES, 2013, 236 : 218 - 223
  • [7] Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubes
    Lu, Huazhong
    Wu, Tingzeng
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2021, 32 (08) : 943 - 956
  • [8] Many-to-many disjoint path covers in a graph with faulty elements
    Park, Jung-Heum
    Kim, Hee-Chul
    Lim, Hyeong-Seok
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3341 : 742 - 753
  • [9] Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
    Park, Jung-Heum
    Kim, Hee-Chul
    Lim, Hyeong-Seok
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (04) : 528 - 540
  • [10] Many-to-many disjoint path covers in a graph with faulty elements
    Park, JH
    Kim, HC
    Lim, HS
    [J]. ALGORITHMS AND COMPUTATION, 2004, 3341 : 742 - 753
12345