Abstract
A set of spanning trees in a graph is said to be independent (ISTs for short) if all the trees are rooted at the same node r and for any other node v(≠r), the paths from v to r in any two trees are node-disjoint except the two end nodes v and r. For an n-connected graph, the independent spanning trees problem asks to construct n ISTs rooted at an arbitrary node of the graph. Recently, Zhang et al. (2013) [18] proposed an algorithm to construct n ISTs with a common root at node 0 in an n-dimensional crossed cube CQn. However, it has been proved by Kulasinghe and Bettayeb (1995) [13] that the CQn (a synonym called multiply-twisted hypercube in that paper) fails to be node-transitive for n⩾5. Thus, the result of Zhang et al. does not really solve the ISTs problem in CQn. In this paper, we revisit the problem of constructing n ISTs rooted at an arbitrary node in CQn. As a consequence, we show that the proposed algorithm can be parallelized to run in O(logN) time using N=2n nodes of CQn as processors.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call