Parallel construction of optimal independent spanning trees on hypercubes

Parallel Computing

Volumn 33, Issue 1, 2007, Pages 73-79

  Yang, Jinn Shyong ^a,d   Tang, Shyue Ming ^b   Chang, Jou Ming ^a   Wang, Yue Li ^c,d  

^a NATIONAL TAIPEI UNIVERSITY OF BUSINESS   (Taiwan)

^b NATIONAL DEFENSE UNIVERSITY   (Taiwan)

^c NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^d NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Algorithms; Hamming distance; Hypercubes; Independent spanning trees; Internally disjoint paths; Latin square

Indexed keywords

ALGORITHMS; BANDWIDTH; BROADCASTING; COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

HAMMING DISTANCE; HYPERCUBES; INDEPENDENT SPANNING TREES; INTERNALLY DISJOINT PATHS; LATIN SQUARE;

TREES (MATHEMATICS);

EID: 33847098799     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2006.12.001     Document Type: Article

References (22)

1. Bao F., Igarashi Y., and Öhring S.R. Reliable broadcasting in product networks. Discrete Applied Mathematics 83 (1998) 3-20
2. Cheriyan J., and Maheshwari S.N. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. Journal of Algorithms 9 (1988) 507-537
3. Chung I. Application of the special latin squares to the parallel routing algorithm on hypercube. Journal of Korean Information Science Society 19 5 (1992)
4. Curran S., Lee O., and Yu X. Finding four independent trees. SIAM Journal on Computing 35 (2006) 1023-1058
5. Ge Z., and Hakimi S.L. Disjoint rooted spanning trees with small depths in deBruijn and Kautz graphs. SIAM Journal on Computing 26 (1997) 79-92
6. Harary F., Hayes J.P., and Wu H.-J. A survey of the theory of hypercube graphs. Computational Mathematics and Applications 15 (1988) 277-289
7. Hasunuma T., and Nagamochi H. Independent spanning trees with small depths in iterated line digraphs. Discrete Applied Mathematics 110 (2001) 189-211
8. Huck A. Independent trees in graphs. Graphs and Combinatorics 10 (1994) 29-45
9. Huck A. Independent trees in planar graphs. Graphs and Combinatorics 15 (1999) 29-77
10. Itai A., and Rodeh M. The multi-tree approach to reliability in distributed networks. Information and Computation 79 (1988) 43-59
11. Iwasaki Y., Kajiwara Y., Obokata K., and Igarashi Y. Independent spanning trees of chordal rings. Information Processing Letters 69 (1999) 155-160
12. Johnsson S.L., and Ho C.-T. Optimum broadcasting and personalized communication in hypercube. IEEE Transactions on Computing 38 9 (1989) 1249-1268
13. Kim S., and Chung I. Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. Information Processing Letters 66 (1998) 141-147
14. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Morgan Kaufman, San Mateo, CA
15. Miura K., Takahashi D., Nakano S., and Nishizeki T. A linear-time algorithm to find four independent spanning trees in four-connected planar graphs. International Journal of Foundations of Computer Science 10 (1999) 195-210
16. Nagai S., and Nakano S. A linear-time algorithm to find independent spanning trees in maximal planar graphs. Proceedings of 26th Workshop on Graph-Theoretic Concepts in Computer Science, WG 2000, LNCS 1928 (2000), Springer 290-301
17. Obokata K., Iwasaki Y., Bao F., and Igarashi Y. Independent spanning trees of product graphs and their construction. IEICE Trans. Fundamentals of Electronics,Communications and Computer Sciences E79-A (1996) 1894-1903
18. Rabin M.O. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM 36 (1989) 335-348
19. Ramanathan P., and Shin K.G. Reliable broadcast in hypercube multicomputers. IEEE Transactions on Computers 37 12 (1988) 1654-1657
20. 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
21. J.-S. Yang, J.-M. Chang, S.-M. Tang, and Y.-L. Wang, Reducing the height of independent spanning trees in chordal rings, IEEE Transactions on Parallel and Distributed Systems, in press.
22. Zehavi A., and Itai A. Three tree-paths. Journal of Graph Theory 13 (1989) 175-188