One-to-many node-disjoint paths of hyper-star networks

Authors:
LáSzló LiptáK;Eddie Cheng;Jong-Seok Kim;Sung Won Kim
Affiliations:
Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, United States;Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, United States;Department of Information and Communication Engineering, Yeungnam University, Gyeongsan, Gyeongbuk, 712-749, Republic of Korea;Department of Information and Communication Engineering, Yeungnam University, Gyeongsan, Gyeongbuk, 712-749, Republic of Korea
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 15
Cited 0

Topological Properties of Hypercubes

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

Journal of the ACM (JACM)
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Topological properties of WK-recursive networks

Journal of Parallel and Distributed Computing
From Hall's matching theorem to optimal routing on hypercubes

Journal of Combinatorial Theory Series B
An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes

Journal of Parallel and Distributed Computing
Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube

EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Strong Rabin numbers of folded hypercubes

Theoretical Computer Science
Node-disjoint paths in hierarchical hypercube networks

Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs

Information Sciences: an International Journal
Embedding hypercubes, rings, and odd graphs into hyper-stars

International Journal of Computer Mathematics
On Disjoint Shortest Paths Routing on the Hypercube

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Longest fault-free paths in hypercubes with vertex faults

Information Sciences: an International Journal
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars

Networks

Quantified Score

Hi-index	0.04

Visualization

Abstract

In practice, it is important to construct node-disjoint paths in networks, because they can be used to increase the transmission rate and enhance the transmission reliability. The hyper-star networks HS(2n,n) were introduced to be a competitive model for both the hypercubes and the star graphs. In this paper, one-to-many node-disjoint paths are constructed between a fixed node and n other nodes of HS(2n,n) such that each of these paths has length at most 4 more than the shortest path to that node. Moreover, their maximum length is not greater than the diameter+2.