標題: Constructing independent spanning trees for hypercubes and locally twisted cubes
作者: Liu, Yi-Jiun
Chou, Well Y.
Lan, James K.
Chen, Chiuyuan
應用數學系
Department of Applied Mathematics
關鍵字: Data broadcasting;Design and analysis of algorithms;Vertex-disjoint spanning trees;Locally twisted cubes;Hypercubes;Parallel algorithm
公開日期: 2009
摘要: Multiple independent spanning trees (ISTs) have applications to fault-tolerant and data broadcasting in interconnections. Thus the designs of multiple ISTs in several classes of networks have been widely investigated. There are two versions of the n ISTs conjecture. The vertex (edge,) conjecture is that any n-connected (n-edge-connected) graph has n vertex-ISTs (edge-ISTs) rooted at an arbitrary vertex r. Note that the vertex conjecture implies the edge conjecture. Recently, Hsieh and Tu proposed an algorithm to construct n edge-ISTs rooted at vertex 0 for the n-dimensional locally twisted cube (LTQ(n)), which is a variant of the n-dimensional hypercube (Q(n)). Since LTQ(n) is not vertex-transitive, Hsieh and Tu's result does not solve the edge conjecture for LTQ(n). In the paper we confirm the vertex conjecture (and hence also the edge conjecture) for LTQ(n) by proposing an algorithm to construct n vertex-ISTs rooted at any vertex. We also confirm the vertex (and also the edge) conjecture for Q(n). To the best of our knowledge, our algorithm is the first algorithm that can construct n vertex-ISTs rooted at any vertex for both LTQ(n) and Q(n).
URI: http://hdl.handle.net/11536/14479
ISBN: 978-1-4244-5403-7
期刊: 2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009)
起始頁: 17
結束頁: 22
Appears in Collections:Conferences Paper