
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
JungHeum Park, HeeChul Kim, HyeongSeok Lim, "ManytoMany Disjoint Path Covers in HypercubeLike Interconnection Networks with Faulty Elements," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 3, pp. 227240, March, 2006.  
BibTex  x  
@article{ 10.1109/TPDS.2006.37, author = {JungHeum Park and HeeChul Kim and HyeongSeok Lim}, title = {ManytoMany Disjoint Path Covers in HypercubeLike Interconnection Networks with Faulty Elements}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {17}, number = {3}, issn = {10459219}, year = {2006}, pages = {227240}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.37}, 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  ManytoMany Disjoint Path Covers in HypercubeLike Interconnection Networks with Faulty Elements IS  3 SN  10459219 SP227 EP240 EPD  227240 A1  JungHeum Park, A1  HeeChul Kim, A1  HyeongSeok Lim, PY  2006 KW  Fault tolerance KW  network topology KW  graph theory KW  faultHamiltonicity KW  embedding KW  strong Hamiltonicity KW  recursive circulants KW  restricted HLgraphs. VL  17 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—A
[1] A. Abdullah, “On Graph Bipartization,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '92), pp. 18471850, 1992.
[2] J.A. Bondy and U.S. R. Murty, Graph Theory with Applications, fifth ed. Am. Elsevier Publishing Co., 1976.
[3] C.H. Chang, C.K. Lin, H.M. Huang, and L.H. Hsu, “The Super Laceability of the Hypercubes,” Information Processing Letters, vol. 92, no. 1, pp. 1521, 2004.
[4] F.B. Chedid, “On the Generalized Twisted Cube,” Information Processing Letters, vol. 55, pp. 4952, 1995.
[5] C.C. Chen and J. Chen, “Nearly Optimal OnetoMany Parallel Routing in Star Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 11961202, 1997.
[6] H.A. Choi, K. Nakajima, and C.S. Rim, “Graph Bipartization and Via Minimization,” SIAM J. Discrete Math., vol. 2, no. 1, pp. 3847, 1989.
[7] P. Cull and S. Larson, “The Möbius Cubes,” Proc. Sixth IEEE Distributed Memory Computing Conf., pp. 699702, 1991.
[8] K. Efe, “A Variation on the Hypercube With Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 13121316, 1991.
[9] K. Efe, “The Crossed Cube Architecture for Parallel Computation,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513524, May 1992.
[10] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, “The Twisted $N{\hbox{}}{\rm {Cube}}$ with Application to Multiprocessing,” IEEE Trans. Computers, vol. 40, no. 1, pp. 8893, Jan. 1991.
[11] S. Gao, B. Novick, and K. Qiu, “From Hall's Matching Theorem to Optimal Routing on Hypercubes,” J. Combinatorial Theory, Series B, vol. 74, pp. 291301, 1998.
[12] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. San Francisco, Calif.: W.H. Freeman and Co., 1979.
[13] Q.P. Gu and S. Peng, “Cluster FaultTolerant Routing in Star Graphs,” Networks, vol. 35, no. 1, pp. 8390, 2000.
[14] P.A.J. Hilbers, M.R.J. Koopman, and J.L.A. van de Snepscheut, “The Twisted Cube,” PARLE: Parallel Architectures and Languages Europe, Vol. I: Parallel Architectures, J. Bakker, A. Nijman, and P. Treleaven, eds., pp. 152159, 1987.
[15] S.Y. Hsieh, G.H. Chen, and C.W. Ho, “FaultFree Hamiltonian Cycles in Faulty Arrangement Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 223237, Mar. 1999.
[16] S.Y. Hsieh, G.H. Chen, and C.W. Ho, “Longest FaultFree Paths in Star Graphs with Edge Faults,” IEEE Trans. Computers, vol. 50, no. 9, pp. 960971, Sept. 2001.
[17] H.C. Hsu, T.K. Li, J.J.M. Tan, and L.H. Hsu, “Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs,” IEEE Trans. Computers, vol. 53, no. 1, pp. 3953, Jan. 2004.
[18] S. Madhavapeddy and I.H. Sudborough, “A Topological Property of Hypercubes: Node Disjoint Paths,” Proc. Second IEEE Symp. Parallel and Distributed Processing (SPDP), pp. 532539, 1990.
[19] C.D. Park and K.Y. Chwa, “Hamiltonian Properties on the Class of HypercubeLike Networks,” Information Processing Letters, vol. 91, pp. 1117, 2004.
[20] J.H. Park, “OnetoOne Disjoint Path Covers in Recursive Circulants,” J. KISS, vol. 30, no. 12, pp. 691698, 2003, (in Korean).
[21] J.H. Park, “OnetoMany Disjoint Path Covers in a Graph with Faulty Elements,” Proc. Int'l Computing and Combinatorics Conf. (COCOON), pp. 392401, Aug. 2004.
[22] J.H. Park and K.Y. Chwa, “Recursive Circulants and their Embeddings among Hypercubes,” Theoretical Computer Science, vol. 244, pp. 3562, 2000.
[23] J.H. Park and H.C. Kim, “Longest Paths and Cycles in Faulty Star Graphs,” J. Parallel Distributed Computing, vol. 64, no. 11, pp. 12861296, 2004.
[24] J.H. Park, H.C. Kim, and H.S. Lim, “ManytoMany Disjoint Path Covers in a Graph with Faulty Elements,” Proc. Int'l Symp. Algorithms and Computation (ISAAC), pp. 742753, Dec. 2004.
[25] J.H. Park, H.C. Kim, and H.S. Lim, “FaultHamiltonicity of HypercubeLike Interconnection Networks,” Proc. IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), Apr. 2005.
[26] A. Sengupta, “On Ring Embedding in Hypercubes with Faulty Nodes and Links,” Information Processing Letters, vol. 68, pp. 207214, 1998.
[27] N.K. Singhvi and K. Ghose, “The Mcube: A Symmetrical Cube Based Network with Twisted Links,” Proc. Ninth IEEE Int'l Parallel Processing Symp. (IPPS), pp. 1116, 1995.
[28] C.H. Tsai, “Linear Array and Ring Embeddings in Conditional Faulty Hypercubes,” Theoretical Computer Science, vol. 314, pp. 431443, 2004.
[29] C.H. Tsai, J.J. M. Tan, Y.C. Chuang, and L.H. Hsu, “Hamiltonian Properties of Faulty Recursive Circulant Graphs,” J. Interconnection Networks, vol. 3, pp. 273289, 2002.
[30] C.H. Tsai, J.J.M. Tan, and L.H. Hsu, “The SuperConnected Property of Recursive Circulant Graphs,” Information Processing Letters, vol. 91, no. 6, pp. 293298, 2004.
[31] Y.C. Tseng, S.H. Chang, and J.P. Sheu, “FaultTolerant Ring Embedding in a Star Graph with Both Link and Node Failures,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 11851195, 1997.
[32] A.S. Vaidya, P.S.N. Rao, and S.R. Shankar, “A Class of HypercubeLike Networks,” Proc. Fifth IEEE Symp. Parallel and Distributed Processing (SPDP), pp. 800803, Dec. 1993.
[33] L. Volkmann and A. Yeo, “Hamiltonian Paths, Containing a Given Path or Collection of Arcs, in Close to Regular Multipartite Tournaments,” Discrete Math., vol. 281, nos. 13, pp. 267276, 2004.
[34] M. Yannakakis, “Node and EdgeDeletion NPComplete Problems,” Proc. 10th ACM Symp. Theory of Computing (STOC), pp. 253264, 1978.