Container problem in bi-rotator graphs

Authors:
Keiichi Kaneko;Yasuto Suzuki;Yukihiro Hasegawa
Affiliations:
Tokyo University of Agriculture and Technology, Tokyo, Japan;Tokyo University of Agriculture and Technology, Tokyo, Japan;Tokyo University of Agriculture and Technology, Tokyo, Japan
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 3
Cited 0

Node-to-set disjoint paths problem in star graphs

Information Processing Letters
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
Three disjoint path paradigms in star networks

SPDP '91 Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give an algorithm for the container problem in bi-rotator graphs. The solution achieves some fault tolerance such as file distribution based information dispersal technique. The algorithm is of polynomial order of n for an n-bi-rotator graph. It is based on recursion and divided into two cases according to the position of the destination node. Performance of the algorithm is also evaluated by computer experiments.