Constructing independent spanning trees for hypercubes and locally twisted cubes

I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks

Volumn , Issue , 2009, Pages 17-22

  Liu, Yi Jiun ^a   Chou, Well Y ^a   Lan, James K ^a   Chen, Chiuyuan ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Data broadcasting; Design and analysis of algorithms; Hypercubes; Locally twisted cubes; Parallel algorithm; Vertex disjoint spanning trees

Indexed keywords

DATA BROADCASTING; DESIGN AND ANALYSIS OF ALGORITHMS; HYPER-CUBES; LOCALLY TWISTED CUBES; SPANNING TREE;

BROADCASTING; DESIGN; PARALLEL ALGORITHMS;

GEOMETRY;

EID: 77949820991     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/I-SPAN.2009.97     Document Type: Conference Paper

References (24)

1. F. Bao , Y. Funyu, Y. Hamada and Y. Igarashi , "Reliable broadcasting and secure distributing in channel networks," IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, vol. E81A, pp. 796-806, 1998.
2. F. Bao , Y. Igarashi and S. R. Ohring, "Reliable broadcasting in product networks," Graph-theoretic Concepts in Computer Science, vol. 1517, pp. 310-323, 1998.
3. Y. S. Chen, C. Y. Chiang and C.Y. Chen, "Multi-node broadcasting in all-ported 3-D wormhole-routed torus using an aggregation-then-distribution strategy," Journal of System Architecyure, vol. 50, pp. 575-589, 2004.
4. S. Curran, O. Lee and X. Yu, "Finding four independent trees," SIAM Journal on Computing, vol. 35, pp. 1023-1058, 2006.
5. J. Cheriyan and S.N. Maheshwari, "Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs," Journal of Algorithms, vol. 9, pp. 507-537,1988.
6. J. Edmonds, "Edge-disjoint branchings," in: R. Rustin, ed., Combinatorial Algorithms, Courant Inst. Sci. Symp. 9 (Algorithmics Press, New York, 1973), pp. 91V96.
7. T. Hasunuma and H. Nagamochi, "Independent spanning trees with small depths in iterated line digraphs," Discrete Applied Mathematics, vol. 110, pp. 189-211, 2001.
8. S. Y. Hsieh and C. J. Tu, "Constructing edge-disjoint spanning trees in locally twisted cubes," Theoretical Computer Science, vol. 410, pp. 8-10, 2009.
9. K. S. Hu, S. S. Yeoh, C. Y. Chen, and L. H. Hsu, "Node-pancyclicity and edge- pancyclicity of hypercube variants," Information Processing Letters, vol. 102 (1) pp. 1-7, 2007.
10. Y. Iwasaki, Y. Kajiwara, K. Obokata and Y. Igarashi, "Independent spanning trees of chordal rings," Information Processing Letters, vol. 69, pp. 155-160, 1999.
11. A. Itai and M. Rodeh, "The multi-tree approach to reliability in distributed networks," Information and Computation, vol. 79, pp. 43-59, 1988.
12. S. Khuller, B. Schieber, "On insependent spanning-trees," Information Processing Letters, vol. 42, pp. 321-323, 1992.
13. K. Miura, D. Takahashi, S. Nakano and T. Nishizeki, "A linear-time algorithm to find four independent spanning trees in four-connected planar graphs," Discrete Applied Mathematics, vol. 83, pp. 3-20, 1998;
14. also in International Journal of Foundations of Computer Science, vol. 10, pp. 195-210, 1999.
15. S. Nagai and S. Nakano, "A linear-time algorithm to find independent spanning trees in maximal planar graphs," IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, vol. E84A, pp. 1102-1109, 2001;
16. also appears in: Proceedings of 26th Workshop on Graph-Theoretic Concepts in Computer Science, WG 2000, LNCS 1928, Springer, 2000, pp. 290-301.
17. K. Obokata, Y. Iwasaki, F. Bao and Y. Igarashi, "Independent spanning trees of product graphs," Lecture Notes in Computer Science, vol. 197, pp. 338-351, 1996.
18. See also: K. Obokata, Y. Iwasaki, F. Bao, Y. Igarashi, "Independent spanning trees of product graphs and their construction," IEICE Trans. Fundamentals of Electronics,Communications and Computer Sciences, E79-A, pp. 1894V1903, 1996.
19. Y. C. Tseng, S. Y.Wang and C.W. Ho, "Efficient broadcasting in wormhole-routed multicomputers: A network-partitioning approach," IEEE Transaction on Parallel and Distributed Systems, vol. 10, pp. 44-61, 1999.
20. S. M. Tang, Y. L. Wang and Y. H. Leu, "Optimal independent spanning trees on hypercubes," Journal of Information Science and Engineering, vol. 20, pp. 143-155, 2004.
21. J. S. Yang, J. M. Chang, S. M. Tang and Y. L. Wang, "Reducing the height of inedpendent spanning trees in chordal rings," IEEE Transactions on Parallel and Distributed Systems, vol. 18, pp. 644-657, 2007.
22. X. Yang, D. J. Evans, and G. M. Megson, "The locally twisted cubes," International Journal of Computer Mathematics, vol. 82, pp. 401-413, 2005.
23. J. S. Yang, S. M. Tang, J. M. Chang and Y. L. Wang, "Parallel construction of optimal independent spanning trees on hypercubes," Parallel Computing, vol. 33, pp. 73-79, 2007.
24. A. Zwhavi and A. Itai, "Three tree-paths," Journal of Graph Theory, vol. 13, pp. 175-188, 1989.