完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Tsai, Ping-Ying | |
| dc.contributor.author | Fu, Jung-Sheng | |
| dc.contributor.author | Chen, Gen-Huey | |
| dc.date.accessioned | 2009-08-23T04:42:32Z | |
| dc.date.accessioned | 2020-05-25T06:51:24Z | - |
| dc.date.available | 2009-08-23T04:42:32Z | |
| dc.date.available | 2020-05-25T06:51:24Z | - |
| dc.date.issued | 2007-01-26T01:07:16Z | |
| dc.date.submitted | 2006-12-04 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/3474 | - |
| dc.description.abstract | The star graph Sn possess many nice topological properties. It is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. It is known that Sn is a bipartite graph. In this paper, we show that for any Sn (n ≥ 4) with ≤ 2n − 7 edge faults in which each node is incident to at least two healthy edges is strongly Hamiltonian laceable. It is also shown that our result is optimal. | |
| dc.description.sponsorship | 元智大學,中壢市 | |
| dc.format.extent | 9p. | |
| dc.format.extent | 4039715 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2006 ICS會議 | |
| dc.subject.other | Processor Interconnection Network | |
| dc.title | Hamiltonian-Laceability in Star Graphs with Conditional Edge Faults | |
| 分類: | 2006年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002006000024.pdf | 3.95 MB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。