One-to-many node-disjoint paths in (n,k)-star graphs

Authors:
Yonghong Xiang;Iain A. Stewart
Affiliations:
Department of Computer Science, Durham University, Science Labs, South Road, Durham DH1 3LE, UK;Department of Computer Science, Durham University, Science Labs, South Road, Durham DH1 3LE, UK
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 10
Cited 0

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
The (n,k)-star graph: a generalized star graph

Information Processing Letters
Node-to-set disjoint paths problem in star graphs

Information Processing Letters
From Hall's matching theorem to optimal routing on hypercubes

Journal of Combinatorial Theory Series B
Constructing One-to-Many Disjoint Paths in Folded Hypercubes

IEEE Transactions on Computers
Nearly Optimal One-to-Many Parallel Routing in Star Networks

IEEE Transactions on Parallel and Distributed Systems
Ring Embedding in Faulty (n, k)-star Graphs

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Extremal Graph Theory

Extremal Graph Theory
Generalized Hypercube and Hyperbus Structures for a Computer Network

IEEE Transactions on Computers
Constructing vertex-disjoint paths in (n, k)-star graphs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present an algorithm which given a source node and a set of n-1 target nodes in the (n,k)-star graph S"n","k, where all nodes are distinct, builds a collection of n-1 node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that each path has length at most 6k-7, and the algorithm has time complexity O(k^2n^2).