An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs

被引：1

作者：

Huang, Yu-Sheng ^{[1
]}

Peng, Sheng-Lung ^{[1
]}

Wu, Ro-Yu ^{[2
]}

机构：

[1] Natl Dong Hwa Univ, Dept Comp Sci & Informat Engn, Hualien 974, Taiwan

[2] Lunghwa Univ Sci & Technol, Dept Ind Management, Taoyuan 333, Taiwan

来源：

JOURNAL OF INTERCONNECTION NETWORKS | 2016年 / 16卷 / 3-4期

关键词：

Node-to-set disjoint paths; bi-rotator graphs; interconnection networks;

D O I：

10.1142/S0219265916500067

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Given a source node and a node set, the node-to-set disjoint paths problem is to find disjoint paths from the source node to all nodes from the node set. In this paper, we propose an improved algorithm for the node-to-set disjoint paths problem on bi-rotator graphs. Our result improves the complexity of previous result from O(n(5)) to O(n(3) log n), where n is the dimension of the input graph.

引用

页数：18

共 50 条

[1] An algorithm for node-to-set disjoint paths problem in bi-rotator graphs
Kaneko, K
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2006, E89D (02): : 647 - 653
[2] Node-to-set disjoint paths problem in bi-rotator graphs
Kaneko, K
[J]. PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2004, 3358 : 556 - 567
[3] An algorithm for node-to-set disjoint paths problem in rotator graphs
Kaneko, K
Suzuki, Y
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2001, E84D (09) : 1155 - 1163
[4] Node-to-set disjoint paths problem in rotator graphs
Kaneko, K
Suzuki, Y
[J]. ADVANCES IN COMPUTING SCIENCE-ASIAN 2000, PROCEEDINGS, 2000, 1961 : 119 - 132
[5] Internally-disjoint paths problem in Bi-rotator graphs
Kaneko, K
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (07): : 1678 - 1684
[6] Node-to-set disjoint paths problem in star graphs
Gu, QP
Peng, ST
[J]. INFORMATION PROCESSING LETTERS, 1997, 62 (04) : 201 - 207
[7] An algorithm for node-to-set disjoint paths problem in burnt pancake graphs
Kaneko, K
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2003, E86D (12): : 2588 - 2594
[8] Node-to-set disjoint paths problem in pancake graphs
Kaneko, K
Suzuki, Y
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2003, E86D (09): : 1628 - 1633
[9] Node-to-Set Disjoint Paths Problem in a Mobius Cube
Kocik, David
Hirai, Yuki
Kaneko, Keiichi
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016, E99D (03): : 708 - 713
[10] Node-to-set disjoint paths with optimal length in star graphs
Gu, QP
Peng, ST
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1997, E80D (04) : 425 - 433

← 1 2 3 4 5 →