DocumentCode
2135364
Title
Fault-tolerant ring embedding in star graphs
Author
Tseng, Yu-Chee ; Chang, Shu-Hui ; Sheu, Jang-Ping
Author_Institution
Dept. of Comput. Sci., Chung-Hua Polytech. Inst., Hsinchu, Taiwan
fYear
1996
fDate
15-19 Apr 1996
Firstpage
660
Lastpage
665
Abstract
We consider an injured star graph with some faulty links and nodes. We show that even with fe⩽n-3 faulty links a Hamiltonian cycle still can be found in an n-star, and that with fv ⩽n-3 faulty nodes a ring containing at most 4fv nodes less than that in a Hamiltonian cycle can be found (i.e., containing at least n!-4fv nodes). In general, in an n-star with fe faulty links and fv faulty nodes, where f e+fv⩽n-3 our embedding is able to establish a ring containing at least n!-4fv nodes
Keywords
fault tolerant computing; graph theory; multiprocessor interconnection networks; parallel algorithms; parallel architectures; Hamiltonian cycle; fault-tolerant ring embedding; faulty links; faulty nodes; injured star graph; multiprocessor interconnection network; star graphs; Computer science; Fault tolerance; Hypercubes; Multiprocessor interconnection networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
Conference_Location
Honolulu, HI
Print_ISBN
0-8186-7255-2
Type
conf
DOI
10.1109/IPPS.1996.508128
Filename
508128
Link To Document