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 条

[21] k-Pairwise cluster fault tolerant routing in hypercubes
Gu, QP
Peng, ST
IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (09) : 1042 - 1049
[22] An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube
Qiu, Ke
PROCEEDINGS OF THE 2008 14TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, : 43 - 47
[23] Disjoint paths in sparse graphs
Bentz, Cedric
DISCRETE APPLIED MATHEMATICS, 2009, 157 (17) : 3558 - 3568
[24] Constructing pairwise disjoint paths with few links
Gupta, H
Wenger, R
ALGORITHMS AND DATA STRUCTURES, 1997, 1272 : 416 - 425
[25] Constructing Pairwise Disjoint Paths with Few Links
Gupta, Himanshu
Wenger, Rephael
ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (03)
[26] A linear time algorithm for the induced disjoint paths problem in planar graphs
Kawarabayashi, Ken-ichi
Kobayashi, Yusuke
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (02) : 670 - 680
[27] An algorithm for finding two node-disjoint paths in arbitrary graphs
Karaata M.H.
Journal of Computing and Information Technology, 2019, 27 (03) : 1 - 14
[28] Maximum Edge-Disjoint Paths in k-Sums of Graphs
Chekuri, Chandra
Naves, Guyslain
Shepherd, F. Bruce
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 328 - 339
[29] RECOGNITION ALGORITHM FOR INTERSECTION GRAPHS OF EDGE-DISJOINT PATHS IN A TREE
PANDA, BS
MOHANTY, SP
INFORMATION PROCESSING LETTERS, 1994, 49 (03) : 139 - 143
[30] Algorithm for two disjoint long paths in 2-connected graphs
Zhou, Shan
Li, Hao
Wang, Guanghui
THEORETICAL COMPUTER SCIENCE, 2010, 411 (34-36) : 3247 - 3254

← 1 2 3 4 5 →