|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes
Kaohsiung, Taiwan
December 14-December 16
ISBN: 978-0-7695-3908-9
| ASCII Text | x | ||
| Yi-Jiun Liu, Well Y. Chou, James K. Lan, Chiuyuan Chen, "Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 17-22, 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/I-SPAN.2009.97, author = {Yi-Jiun Liu and Well Y. Chou and James K. Lan and Chiuyuan Chen}, title = {Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2009}, isbn = {978-0-7695-3908-9}, pages = {17-22}, doi = {http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2009.97}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes SN - 978-0-7695-3908-9 SP17 EP22 A1 - Yi-Jiun Liu, A1 - Well Y. Chou, A1 - James K. Lan, A1 - Chiuyuan Chen, PY - 2009 VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER - | |||
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 LTQn, which is a variant of the n-dimensional hypercube Qn. Since LTQn 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
Citation:
Yi-Jiun Liu, Well Y. Chou, James K. Lan, Chiuyuan Chen, "Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes," ispan, pp.17-22, 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009
Usage of this product signifies your acceptance of the Terms of Use.