
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ShanChyun Ku, BiingFeng Wang, TingKai Hung, "Constructing EdgeDisjoint Spanning Trees in Product Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 213221, March, 2003.  
BibTex  x  
@article{ 10.1109/TPDS.2003.1189580, author = {ShanChyun Ku and BiingFeng Wang and TingKai Hung}, title = {Constructing EdgeDisjoint Spanning Trees in Product Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {14}, number = {3}, issn = {10459219}, year = {2003}, pages = {213221}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2003.1189580}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Constructing EdgeDisjoint Spanning Trees in Product Networks IS  3 SN  10459219 SP213 EP221 EPD  213221 A1  ShanChyun Ku, A1  BiingFeng Wang, A1  TingKai Hung, PY  2003 KW  Cartesian product networks KW  edgedisjoint trees KW  spanning trees KW  embedding KW  faulttolerance KW  interconnection networks. VL  14 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—A Cartesian product network is obtained by applying the cross operation on two graphs. In this paper, we study the problem of constructing the maximum number of edgedisjoint spanning trees (abbreviated to EDSTs) in Cartesian product networks. Let
[1] F. Bao, Y. Igarashi, and S.R. Öhring, “Reliable Broadcasting in Product Networks,” Discrete Applied Math., vol. 83, pp. 320, 1998.
[2] B. Barden, R. LibeskindHadas, J. Davis, and W. Williams, “On EdgeDisjoint Spanning Trees in Hypercubes,” Information Processing Letters, vol. 70, pp. 1316, 1999.
[3] S. Bettayeb, “On the$\big. k{\hbox{}}{\rm{ary}}\bigr.$Hypercube,” Theoretical Computer Science, vol. 140, no. 2, pp. 333339, 1995.
[4] J.C. Bermond, “Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs,” Annals of Discrete Math., vol. 3, pp. 3138, 1978.
[5] S.K. Das, S.R. Öhring, and A.K. Banerjee, “Embeddings Into Hyper Petersen Network: Yet Another HypercubeLike Interconnection Topology,” VLSI Design, vol. 2, no. 4, pp. 335351, 1995.
[6] K. Day and A.E. AlAyyoub, “The Cross Product of Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 2, pp. 109118, Feb. 1997.
[7] V.V. Dimakopoulos and N.J. Dimopoulos, “A Theory for Total Exchange in Multidimensional Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 7, pp. 639649, July 1998.
[8] K. Efe and A. Fernandez, “Computational Properties of Mesh Connected Trees: Versatile Architecture for Parallel Computation,” Proc. Int'l Conf. Parallel Processing, pp. 7276, 1994.
[9] A. Fernández and K. Efe, “Generalized Algorithm for Parallel Sorting on Product Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 12111225, 1997.
[10] A. Fernández and K. Efe, "Efficient VLSI Layouts for Homogeneous Product Networks," IEEE Trans. Computers, vol. 46, no. 10, pp. 1,0701,082, Oct. 1997.
[11] P. Fragopoulou and S.G. Akl, “EdgeDisjoint Spanning Trees on the Star Network with Applications to Fault Tolerance,” IEEE Trans. Computers, vol. 45, no. 2, pp. 174185, Feb. 1996.
[12] P. Fragopoulou, P.S.G. Akl, and H. Meijer, “Optimal Communication Primitives on the Generalized Hypercube Network,” J. Parallel and Distributed Computing, vol. 32, no. 2, pp. 173187, 1996.
[13] F. Harary, “On the Group of the Composition of Two Graphs,” Duke Math. J., vol. 26, 1959.
[14] T. Hasunuma, “On EdgeDisjoint Spanning Trees With Small Depths,” Information Processing Letters, vol. 75, pp. 7174, 2000.
[15] A. Itai and M. Rodeh, “The MultiTree Approach to Reliability in Distributed Networks,” Information and Computation, vol. 79, pp. 4359, 1988.
[16] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,2491,268, Sept. 1989.
[17] R. LibeskindHadas, D. Mazzoni, and R. Rajagopalan, “TreeBased Multicasting in WormholeRouted Irregular Topologies,” Proc. Merged 12th Int'l Parallel Processing Symp. and the Ninth Symp. Parallel and Distributed Processing, pp. 244249, Apr. 1998.
[18] G. Sabidussi, “The Composition of Graphs,” Duke Math. J., vol. 26, pp. 693696, 1959.
[19] R. Stong, “Hamilton Decompositions of Cartesian Products of Graphs,” Discrete Math., vol. 90, pp. 169190, 1991.
[20] J. Roskind and R. Tarjan, “A Note on Finding MaximumCost EdgeDisjoint Spanning Trees,” Math. Operations Research, vol. 10, no. 2, pp. 701708, Nov. 1985.
[21] H. Wang and D. Blough, “Construction of EdgeDisjoint Spanning Trees in the Torus and Application to Multicast in WormholeRouted Networks,” Proc. Int'l Conf. Parallel and Distributed Computing Systems, 1999.