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 条
  • [1] Set-to-Set Disjoint Paths Problem in Mobius Cubes
    Ichida, Hiroyuki
    Kaneko, Keiichi
    [J]. IEEE ACCESS, 2022, 10 : 83075 - 83084
  • [2] The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes
    Bossard, Antoine
    Kaneko, Keiichi
    [J]. COMPUTER JOURNAL, 2012, 55 (06): : 769 - 775
  • [3] Set-to-Set Disjoint Paths in Tori
    Kaneko, Keiichi
    Bossard, Antoine
    [J]. 2016 FOURTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2016, : 91 - 97
  • [4] Optimal node-disjoint paths in folded hypercubes
    Lai, Cheng-Nan
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2021, 147 : 100 - 107
  • [5] Set-to-set disjoint paths in a folded hypercube
    Ichida, Hiroyuki
    Kaneko, Keiichi
    [J]. THEORETICAL COMPUTER SCIENCE, 2024, 1000
  • [6] Two node-disjoint paths in balanced hypercubes
    Cheng, Dongqin
    Hao, Rong-Xia
    Feng, Yan-Quan
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2014, 242 : 127 - 142
  • [7] Set-to-set disjoint paths routing in pancake graphsc
    Peng, Shietung
    Kaneko, Keiichi
    [J]. PROCEEDINGS OF THE 18TH IASTED INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING AND SYSTEMS, 2006, : 253 - +
  • [8] Set-to-Set Disjoint-path Routing in Perfect Hierarchical Hypercubes
    Bossard, Antoine
    Kaneko, Keiichi
    [J]. PROCEEDINGS OF THE FOURTH INTERNATIONAL C* CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING 2011 (C3S2E '11), 2011, : 51 - 57
  • [9] An efficient construction of one-to-many node-disjoint paths in folded hypercubes
    Lai, Cheng-Nan
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (04) : 2310 - 2316
  • [10] Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks
    Bossard, Antoine
    Kaneko, Keiichi
    [J]. COMPUTER JOURNAL, 2014, 57 (02): : 332 - 337
12345