We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

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

Stewart, I. A. and Xiang, Y. (2010) 'One-to-many node-disjoint paths in (n,k)-star graphs.', Discrete applied mathematics., 158 (1). pp. 62-70.


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)$.

Item Type:Article
Keywords:Interconnection networks, (n,k)-star graphs, Many-to-one node-disjoint paths.
Full text:PDF - Accepted Version (146Kb)
Publisher Web site:
Record Created:21 Oct 2009 16:50
Last Modified:29 Nov 2011 09:17

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library