An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes

被引：2
|
作者：
Gu, QP [1 ]
Peng, ST [1 ]
机构：
[1] UNIV AIZU,AIZU WAKAMATSU,FUKUSHIMA 96580,JAPAN
来源：
1996 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS | 1996年
关键词：
graph algorithms; interconnection networks; node-disjoint paths; hypercubes;
D O I：
10.1109/ICPADS.1996.517550
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：98 / 105
页数：8
相关论文
共 50 条
  • [31] An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
    Gu, QP
    Peng, ST
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2000, 60 (06) : 764 - 774
  • [32] On the Decomposition of Posets into Minimum Set Node-Disjoint Chains
    Chen, Yangjun
    Chen, Yibin
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER, NETWORKS AND COMMUNICATION ENGINEERING (ICCNCE 2013), 2013, 30 : 125 - 130
  • [33] Fault-tolerant routing over shortest node-disjoint paths in hypercubes
    Umrao, Lokendra Singh
    Singh, Ravi Shankar
    [J]. INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2016, 31 (03) : 294 - 304
  • [34] Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing
    Liu, Shuai
    Wang, Yan
    Fan, Jianxi
    Cheng, Baolei
    [J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2023, PT III, 2024, 14489 : 40 - 56
  • [35] An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs
    Huang, Yu-Sheng
    Peng, Sheng-Lung
    Wu, Ro-Yu
    [J]. JOURNAL OF INTERCONNECTION NETWORKS, 2016, 16 (3-4)
  • [36] Node-to-set disjoint paths problem in cross-cubes
    Wang, Xi
    Fan, Jianxi
    Zhang, Shukui
    Yu, Jia
    [J]. JOURNAL OF SUPERCOMPUTING, 2022, 78 (01): : 1356 - 1380
  • [37] Node-to-Set Disjoint Paths Problem in Cross-Cubes
    Sasaki, Rikuya
    Ichida, Hiroyuki
    Kyaw, Htoo Htoo Sandi
    Kaneko, Keiichi
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2024, E107D (01) : 53 - 59
  • [38] Node-to-set disjoint paths problem in cross-cubes
    Xi Wang
    Jianxi Fan
    Shukui Zhang
    Jia Yu
    [J]. The Journal of Supercomputing, 2022, 78 : 1356 - 1380
  • [39] A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes
    Bossard, Antoine
    Kaneko, Keiichi
    Peng, Shietung
    [J]. COMPUTER JOURNAL, 2011, 54 (08): : 1372 - 1381
  • [40] Node-disjoint paths in a transposition graph
    Suzuki, Y
    Kaneko, K
    Nakamori, M
    [J]. PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3, 2004, : 298 - 304
12345