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 条
  • [31] An algorithm for node-to-set disjoint paths problem in rotator graphs
    Kaneko, K
    Suzuki, Y
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2001, E84D (09) : 1155 - 1163
  • [32] ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES
    Thilak, A. Senthil
    Shet, Sujatha, V
    Kamath, S. S.
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2021, 26 (01): : 83 - 108
  • [33] The Number of Shortest Paths in the (n, k)-Star Graphs
    Cheng, Eddie
    Qiu, Ke
    Shen, Zhi Zhang
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT 1, 2010, 6508 : 222 - +
  • [34] Application of K Disjoint Shortest Paths Algorithm in Vision Recognition
    Tsvetanov, Sevdalin
    Marinova, Daniela
    SEVENTH INTERNATIONAL CONFERENCE ON NEW TRENDS IN THE APPLICATIONS OF DIFFERENTIAL EQUATIONS IN SCIENCES (NTADES 2020), 2021, 2321
  • [35] EFFICIENT PARALLEL ALGORITHMS FOR TESTING K-CONNECTIVITY AND FINDING DISJOINT S-T PATHS IN GRAPHS
    KHULLER, S
    SCHIEBER, B
    SIAM JOURNAL ON COMPUTING, 1991, 20 (02) : 352 - 375
  • [36] Finding Disjoint Paths in Split Graphs
    Heggernes, Pinar
    van 't Hof, Pim
    van Leeuwen, Erik Jan
    Saei, Reza
    SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 315 - 326
  • [37] CONSTRUCTING DISJOINT PATHS ON EXPANDER GRAPHS
    PELEG, D
    UPFAL, E
    COMBINATORICA, 1989, 9 (03) : 289 - 313
  • [38] Disjoint Paths in Graphs III, Characterization
    Xingxing Yu
    Annals of Combinatorics, 2003, 7 (2) : 229 - 246
  • [39] Finding Disjoint Paths in Split Graphs
    Heggernes, Pinar
    Van't Hof, Pim
    van Leeuwen, Erik Jan
    Saei, Reza
    THEORY OF COMPUTING SYSTEMS, 2015, 57 (01) : 140 - 159
  • [40] Vertex-disjoint paths in graphs
    Egawa, Y
    Ota, K
    ARS COMBINATORIA, 2001, 61 : 23 - 31
12345