Constructing edge-disjoint spanning trees in locally twisted cubes

Theoretical Computer Science

Volumn 410, Issue 8-10, 2009, Pages 926-932

  Hsieh, Sun Yuan ^a   Tu, Chang Jen ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Data broadcasting; Design and analysis of algorithms; Edge disjoint spanning trees; Graph theoretic interconnection networks; Locally twisted cubes

Indexed keywords

BROADCASTING; DECODING; FAULT TOLERANCE; INTERCONNECTION NETWORKS; QUALITY ASSURANCE; RELIABILITY; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

DATA BROADCASTING; DESIGN AND ANALYSIS OF ALGORITHMS; EDGE-DISJOINT SPANNING TREES; GRAPH-THEORETIC INTERCONNECTION NETWORKS; LOCALLY TWISTED CUBES;

GRAPH THEORY;

EID: 59049093578     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.12.025     Document Type: Article

References (19)

1. Chen Y.S., Juang T.Y., and Shen Y.Y. Congestion-free embedding of 2 (n - k) spanning trees in an arrangement graph. Journal of System Architecture 47 (2001) 73-86
2. Cheriyan J., and Maheshwari S.N. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. Journal of Algorithm 9 (1988) 507-537
3. Curran S., Lee O., and Yu X. Finding four independent trees. SIAM Journal on Computing 35 (2006) 1023-1058
4. Day K., and Tripathi A. Arrangement graphs: A class of generalized star graphs. Information Processing Letters 42 5 (1992) 235-241
5. Fragopoulou P. Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Transactions on Computers 45 2 (1996) 174-185
6. Fraigniaud P., and Ho C.T. Arc-disjoint spanning trees on the cube-connected-cycles network. Proceedings of the International Conference on Parallel Processing vol. 1 (1991) 225-229
7. Huck A. Independent trees in planar graphs. Graphs and Combinatorics 15 (1999) 29-77
8. Itai A., and Rodeh M. The multi-tree approach to reliability in distributed networks. Information and Computation 79 (1988) 43-59
9. Iwasaki Y., Ajiwara Y.K., Obokata K., and Igarashi Y. Independent spanning trees of chordal rings. Information Processing Letters 69 (1999) 155-160
10. Johnsson S.L., and Ho C.T. Optimal broadcasting and personalized communication in hypercubes. IEEE Transactions on Computing 38 9 (1989) 1249-1268
11. Lin C.T. Embedding k (n - k) edge-disjoint spanning trees in arrangement graphs. Journal of Parallel and Distributed Computing 63 5 (2003) 1277-1287
12. Obokata K., Iwasaki Y., Bao F., and Igarashi Y. Independent spanning trees of product graphs and their construction. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences 79 (1996) 1894-1903
13. Ramanathan P., and Shin K.G. Reliable broadcast in hypercube multicomputers. IEEE Transactions on Computers 37 12 (1988) 1654-1657
14. Tang S.M., Wang Y.L., and Leu Y.H. Optimal independent spanning trees on hypercubes. Journal of Information Science and Engineering 20 (2004) 143-155
15. S.M. Tang, J.S. Yang, J.M. Chang, Y.L. Wang, Parallel construction of independent spanning trees on multidimensional tori, in: Proceeding of the 24th Workshop on Combinatorial Mathematics and Computation Theory, 2007, pp. 85-93
16. Yang X., Evans D.J., and Megson G.M. The locally twisted cubes. International Journal of Computer Mathematics 82 4 (2005) 401-413
17. Yang J.S., Tang S.M., Chang J.M., and Wang Y.L. Parallel construction of optimal independent spanning trees on hypercubes. Parallel Computing 33 (2007) 73-79
18. Yang J.S., Chang J.M., Tang S.M., and Wang Y.L. Reducing the height of independent spanning trees in chordal rings. IEEE Transactions on Parallel and Distributed Systems 18 5 (2007)
19. m, d) with d ≥ 3, in: Proceeding of the 25th Workshop on Combinatorial Mathematics and Computation Theory, 2008, pp. 34-43