Node-to-Set Disjoint Paths Problem in Rotator Graphs

Authors:
Keiichi Kaneko;Yasuto Suzuki
Affiliations:
-;-
Venue:
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Year:
2000

Citing 10
Cited 0

Hypernet: A communication-efficient architecture for constructing massively parallel computers

IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Hierarchical Interconnection Networks for Multicomputer Systems

IEEE Transactions on Computers
Hierarchical Cubic Networks

IEEE Transactions on Parallel and Distributed Systems
Node-to-set disjoint paths problem in star graphs

Information Processing Letters
Conflict-free channel set assignment for an optical cluster interconnection network based on rotator digraphs

Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give an algorithmfor the node-to-set disjoint paths problemi n rotator graphs. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The proof of correctness of our algorithm, the sum of the length of paths, and the time complexity are also given.