
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChengNan Lai, "Optimal Construction of All Shortest NodeDisjoint Paths in Hypercubes with Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 6, pp. 11291134, June, 2012.  
BibTex  x  
@article{ 10.1109/TPDS.2011.261, author = {ChengNan Lai}, title = {Optimal Construction of All Shortest NodeDisjoint Paths in Hypercubes with Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {6}, issn = {10459219}, year = {2012}, pages = {11291134}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.261}, 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  Optimal Construction of All Shortest NodeDisjoint Paths in Hypercubes with Applications IS  6 SN  10459219 SP1129 EP1134 EPD  11291134 A1  ChengNan Lai, PY  2012 KW  Hypercube KW  nodedisjoint paths KW  matching KW  optimization problem. VL  23 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] B. Bollobás, Extremal Graph Theory. Academic Press, 1978.
[2] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. Elsevier, 1976.
[3] 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, Dec. 1997.
[4] X.B. Chen, "ManytoMany Disjoint Paths in Faulty Hypercubes," Information Sciences, vol. 179, no. 18, pp. 31103115, 2009.
[5] E. Cheng, S. Gao, K. Qiu, and Z. Shen, "On Disjoint Shortest Paths Routing on the Hypercube," Proc. Third Ann. Int'l Conf. Combinatorial Optimization and Applications (COCOA '09), pp. 375383, 2009.
[6] K. Day and A.E. AlAyyoub, "Fault Diameter of $k$ ary $n$ cube Networks," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 9, pp. 903907, Sept. 1997.
[7] M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, "Three Disjoint Path Paradigms in Star Networks," Proc. IEEE Third Symp. Parallel and Distributed Processing, pp. 400406, 1991.
[8] D.R. Duh and G.H. Chen, "On the Rabin Number Problem," Networks, vol. 30, no. 3, pp. 219230, 1997.
[9] D.R. Duh, G.H. Chen, and D.F. Hsu, "Combinatorial Properties of Generalized Hypercube Graphs," Information Processing Letters, vol. 57, no. 1, pp. 4145, 1996.
[10] A. ElAmawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 3142, Jan. 1991.
[11] J.S. Fu, "Longest FaultFree Paths in Hypercubes with Vertex Faults," Information Science, vol. 176, pp. 759771, 2006.
[12] Z. Galil, "Efficient Algorithms for Finding Maximum Matching in Graphs," ACM Computing Surveys, vol. 18, no. 1, pp. 2338, 1986.
[13] 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.
[14] T.F. Gonzalez and D. Serena, "$n$ Cube Network: Node Disjoint Shortest Paths for Maximal Distance Pairs of Vertices," Parallel Computing, vol. 30, no. 8, pp. 973998, 2004.
[15] Q.P. Gu and S. Peng, "An Efficient Algorithm for the $k$ Pairwise Disjoint Paths Problem in Hypercubes," J. Parallel and Distributed Computing, vol. 60, pp. 764774, 2000.
[16] Q.P. Gu and S. Peng, "$k$ Pairwise Cluster Fault Tolerant Routing in Hypercubes," IEEE Trans. Computers, vol. 46, no. 9, pp. 10421049, Sept. 1997.
[17] Q.P. Gu and S. Peng, "NodetoSet and SettoSet Cluster Fault Tolerant Routing in Hypercubes," Parallel Computing, vol. 24, pp. 12451261, 1998.
[18] S.Y. Hsieh and N.W. Chang, "Extended FaultTolerant Cycle Embedding in Faulty Hypercubes," IEEE Trans. Reliability, vol. 58, no. 4, pp. 702710, Dec. 2009.
[19] S.Y. Hsieh and Y.F. Weng, "FaultTolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults," Theory of Computing Systems, vol. 45, no. 2, pp. 407425, 2009.
[20] D.F. Hsu, "On Container Width and Length in Graphs, Groups, and Networks," IEICE Trans. Fundamentals of Electronics, Comm. and Computer Science, vol. E77A, no. 4, pp. 668680, 1994.
[21] C.N. Lai, "OnetoMany Disjoint Paths in the Hypercube and Folded Hypercube," PhD thesis, Dept. of Computer Science and Information Eng., Nat'l Taiwan Univ., 2001.
[22] C.N. Lai, G.H. Chen, and D.R. Duh, "Constructing OnetoMany Disjoint Paths in Folded Hypercubes," IEEE Trans. Computers, vol. 51, no. 1, pp. 3345, Jan. 2002.
[23] C.N. Lai and G.H. Chen, "$w$ Rabin Numbers and Strong $w$ Rabin Numbers of Folded Hypercubes," Networks, vol. 51, no. 3, pp. 171177, 2008.
[24] S. Latifi, H. Ko, and P.K. Srimani, "NodetoSet Vertex Disjoint Paths in Hypercube Networks," Technical Report CS98107, Colorado State Univ., 1998.
[25] S.C. Liaw and G.J. Chang, "Generalized Diameters and Rabin Numbers of Networks," J. Combinatorial Optimization, vol. 4, pp. 371384, 1999.
[26] K. Qiu, "An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube," Proc. IEEE 14th Int'l Conf. Parallel and Distributed Systems (ICPADS '08), pp. 4347, 2008.
[27] M.O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance," J. ACM, vol. 36, no. 2, pp. 335348, 1989.
[28] Y. Saad and M.H. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[29] D. Wang, "A LowCost FaultTolerant Structure for the Hypercube," J. Supercomputing, vol. 20, no. 3, pp. 203216, 2001.
[30] R.Y. Wu, G.H. Chen, Y.L. Kuo, and G.J. Chang, "NodeDisjoint Paths in Hierarchical Hypercube Networks," Information Sciences, vol. 177, no. 19, pp. 42004207, 2007.