Parallel Construction of Independent Spanning Trees on Parity Cubes

Zehavi and Itai (1989) proposed the following conjecture: every k-connected graph has k independent spanning trees (ISTs for short) rooted at an arbitrary node. An n-dimensional parity cube, denoted by PQn, is a variation of hyper cubes with connectivity n and has many features superior to those of hyper cubes. Recently, Wang et al. (2012) confirm the ISTs conjecture by providing an O(N log N) algorithm to construct n ISTs rooted at an arbitrary node on PQn, where N=2n is the number of nodes in PQn. However, this algorithm is executed in a recursive fashion and thus is hard to be parallelized. In this paper, we present a non-recursive and fully parallelized approach to construct n ISTs rooted at an arbitrary node of PQn in O(log N) time using N processors. In particular, the constructing rule of spanning trees is simple and the proof of independency is easier than ever before.

[1]  Xiaohua Jia,et al.  Embedding meshes into twisted-cubes , 2011, Inf. Sci..

[2]  Xiaohua Jia,et al.  Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes , 2013, J. Parallel Distributed Comput..

[3]  Deqiang Wang,et al.  The twisted-cube connected networks , 2008, Journal of Computer Science and Technology.

[4]  Xingxing Yu,et al.  Finding Four Independent Trees , 2006, SIAM J. Comput..

[5]  Hyeong-Seok Lim,et al.  Fault-Hamiltonicity of hypercube-like interconnection networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[6]  Tao Xiang,et al.  Independent spanning trees in crossed cubes , 2013, Inf. Process. Lett..

[7]  Yoshihide Igarashi,et al.  Reliable broadcasting and secure distributing in channel networks , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[8]  Xiaohua Jia,et al.  Constructive Algorithm of Independent Spanning Trees on Möbius Cubes , 2013, Comput. J..

[9]  Jou-Ming Chang,et al.  Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs , 2014, Comput. J..

[10]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

[11]  Xiaohua Jia,et al.  An algorithm to construct independent spanning trees on parity cubes , 2012, Theor. Comput. Sci..

[12]  Alon Itai,et al.  Three tree-paths , 1989, J. Graph Theory.

[13]  Jou-Ming Chang,et al.  Broadcasting secure messages via optimal independent spanning trees in folded hypercubes , 2011, Discret. Appl. Math..

[14]  Jou-Ming Chang,et al.  Parallel construction of optimal independent spanning trees on hypercubes , 2007, Parallel Comput..

[15]  Peter A. J. Hilbers,et al.  The Twisted Cube , 1987, PARLE.

[16]  A. J. Nijman,et al.  PARLE Parallel Architectures and Languages Europe , 1987, Lecture Notes in Computer Science.

[17]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

[18]  Adele A. Rescigno,et al.  Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security , 2001, Inf. Sci..

[19]  S. N. Maheshwari,et al.  Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs , 1988, J. Algorithms.