Proof that pyramid networks are 1-Hamiltonian-connected with high probability

Information Sciences

Volumn 177, Issue 19, 2007, Pages 4188-4199

  Duh, Dyi Rong ^a   Chen, Yi Ching ^b   Wu, Ruei Yu ^c  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^b Zinwell Corporation   (Taiwan)

^c HWA HSIA INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Fault tolerant embedding; Hamiltonian connectedness; Interconnection networks; Pyramid networks

Indexed keywords

FAULT-TOLERANT EMBEDDING; HAMILTONIAN-CONNECTEDNESS; PYRAMID NETWORKS;

HAMILTONIANS; INTERCONNECTION NETWORKS; PROBABILITY;

INFORMATION SCIENCE;

EID: 34447319151     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.03.013     Document Type: Article

References (30)

1. Aggarwal C.C., Jain N., and Gupta P. An efficient selection algorithm on the pyramid. Information Processing Letters 53 (1995) 37
2. Avresky D.R. Embedding and reconfiguration of spanning trees in faulty hypercubes. IEEE Transactions on Parallel and Distributed Systems 10 3 (1999) 211-222
3. Balakrishnan R., and Ranganathan K. A Textbook of Graph Theory (1999), Springer, NY
4. Brandt S. 9-connected claw-free graphs are Hamiltonian-connected. Journal of Combinatorial Theory Series B 75 2 (1999) 167-173
5. Cao F., Du D.Z., Hsu D.F., and Teng S.H. Fault tolerance properties of pyramid networks. IEEE Transactions on Computers 48 1 (1999) 88-93
6. Y.C. Chen, D.R. Duh, R.Y. Wu, Hamiltonian-connectedness of the pyramid network with one faulty node, in: Proceedings of the International Conference on Parallel and Distributed Computing and Networks, 2005, pp. 147-152.
7. Chen Y.W., and Chung K.L. A parallel approach for embedding large pyramids into smaller hypercubes with load balancing. Journal of Information Science and Engineering 16 (2000) 117-126
8. Cinque L., and Bongiovanni G. Parallel prefix computation on a pyramid computer. Pattern Recognition Letters 16 (1995) 19-22
9. Cipher R., and Sanz H.L.G. SIMD architectures and algorithms for image processing and computer vision. IEEE Transactions on Acoustic Speech and Signal processing 37 (1989) 2158-2174
10. Fu J.S. Longest fault-free paths in hypercubes with vertex faults. Information Sciences 176 7 (2006) 759-771
11. Guo Z., and Melhem R.G. Embedding binary X-trees and pyramids in processor array with spanning buses. IEEE Transactions on Parallel and Distributed Systems 5 6 (1994) 664-672
12. Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with vertex faults. Theoretical Computer Science 262 1-2 (2001) 215-227
13. Hsieh S.Y., Ho C.W., and Chen G.H. Longest fault-free paths in star graphs with edge faults. IEEE Transactions on Computers 50 9 (2001) 960-971
14. Jenq J.F., and Sahni S. Image shrinking and expanding on a pyramid. IEEE Transactions on Parallel and Distributed Systems 4 11 (1993) 1291-1296
15. Li T.K., Tan J.M., and Hsu L.H. Hyper Hamiltonian laceability on the edge fault star graph. Information Sciences 165 1-2 (2004) 59-71
16. Lindquester T.E. The effects of distance and neighborhood union conditions on Hamiltonian properties in graph. Journal of Graph Theory 13 3 (1989) 335-352
17. Lo R.S., and Chen G.H. Embedding longest fault-free paths in arrangement graphs with faulty vertices. Networks 37 2 (2001) 84-93
18. Ng C.K.Y., Pun L.K.L., Ip D.M.C., Hamdi M., and Ahmad I. Embedding pyramids into 3D meshes. Journal of Parallel and Distributed Computing 36 (1996) 173-184
19. Ore J. Hamiltonian paths in oriented graphs. Journal of Combinatorial Theory Series B 21 (1976) 76-80
20. Quinn M.J. Designing Efficient Algorithms for Parallel Computers (1987), McGraw-Hill, New York
21. Sarbazi-Azad H., Ould-Khaoua M., and Mackenzie L.M. Algorithmic construction of Hamiltonians in pyramids. Information Processing Letters 80 (2001) 75-79
22. Senoussi H., and Saoudi A. A quadtree algorithm for template matching on a pyramid computer. Theoretical Computer Science 136 (1994) 387-417
23. Steiner G. On the k-path partition of graphs. Theoretical Computer Science 290 (2003) 2147-2155
24. Stout Q.F. Mapping vision algorithms to parallel architectures. Proceedings of the IEEE 76 8 (1988) 982-995
25. West D.B. Introduction to Graph Theory. second ed. (2001), Prentice-Hall, Upper Saddle River, NJ
26. Wong P.K. Optimal path cover problem on block graphs. Theoretical Computer Science 225 (1999) 163-169
27. R.Y. Wu, Hamiltonicity of pyramid networks, Master Thesis, National Chi Nan University, Puli, Nantou, Taiwan, 2001.
28. Xu J. Topological Structure and Analysis of Interconnection Networks (2001), Kluwer Academic, Dordrecht
29. Yan J.H., Chang G.J., Hedetniemi S.M., and Hedetniemi S.T. k-Path partitions in trees. Discrete Applied Mathematics 78 (1997) 227-233
30. Yang M.C., Li T.K., Tan J.M., and Hsu L.H. On embedding cycles into faulty twisted cubes. Information Sciences 176 6 (2006) 676-690