Efficient algorithm for k-pairwise disjoint paths in star graphs

被引：0
|
作者：
Univ of Aizu, Fukushima, Japan [1 ]
机构：
来源：
Inf Process Lett | / 6卷 / 283-287期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] An efficient algorithm for k-pairwise disjoint paths in star graphs
    Gu, QP
    Peng, ST
    [J]. INFORMATION PROCESSING LETTERS, 1998, 67 (06) : 283 - 287
  • [2] 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
  • [3] k-pairwise disjoint paths routing in perfect hierarchical hypercubes
    Antoine Bossard
    Keiichi Kaneko
    [J]. The Journal of Supercomputing, 2014, 67 : 485 - 495
  • [4] k-pairwise disjoint paths routing in perfect hierarchical hypercubes
    Bossard, Antoine
    Kaneko, Keiichi
    [J]. JOURNAL OF SUPERCOMPUTING, 2014, 67 (02): : 485 - 495
  • [5] An Algorithm for k-pairwise Cluster-fault-tolerant Disjoint Paths in a Burnt Pancake Graph
    Tokuda, Masato
    Hirai, Yuki
    Kaneko, Keiichi
    [J]. 2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI), 2015, : 651 - 655
  • [6] Pairwise disjoint paths in pancake graphs
    Sawada, Naoki
    Kaneko, Keiichi
    Peng, Shietung
    [J]. EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2007, : 376 - +
  • [7] Constructing vertex-disjoint paths in (n,k)-star graphs
    Lin, Tsung-Chi
    Duh, Dyi-Rong
    [J]. INFORMATION SCIENCES, 2008, 178 (03) : 788 - 801
  • [8] Efficient algorithm for the vertex disjoint paths problem in random graphs
    Broder, AZ
    Frieze, AM
    Suen, S
    Upfal, E
    [J]. PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 261 - 268
  • [9] Efficient Algorithms for Listing k Disjoint st-Paths in Graphs
    Grossi, Roberto
    Marino, Andrea
    Versari, Luca
    [J]. LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 544 - 557
  • [10] One-to-many node-disjoint paths in (n, k)-star graphs
    Xiang, Yonghong
    Stewart, Iain A.
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (01) : 62 - 70
12345