完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Hung, Chun-Nan | |
dc.contributor.author | Zhu, Xiao-Shen | |
dc.date.accessioned | 2009-08-23T04:46:36Z | |
dc.date.accessioned | 2020-05-29T06:16:13Z | - |
dc.date.available | 2009-08-23T04:46:36Z | |
dc.date.available | 2020-05-29T06:16:13Z | - |
dc.date.issued | 2006-10-13T09:38:46Z | |
dc.date.submitted | 2001-12-20 | |
dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/1261 | - |
dc.description.abstract | The Hamiltonian property is one of major requirements in designing the topology of networks. Fault tolerance is also required for distributed systems. In this paper, we introduce the concepts of (node, edge) Hamiltonian- connectivity. Furthermore, we present construction schemes for fault-tolerant Hamiltonian and Hamiltonian-connected networks. | |
dc.description.sponsorship | 中國文化大學,台北市 | |
dc.format.extent | 10p. | |
dc.format.extent | 238801 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 2001 NCS會議 | |
dc.subject | fault tolerance | |
dc.subject | Hamiltonian cycle | |
dc.subject | Hamiltonian-connectivity | |
dc.subject | edge-Hamiltonian-connectivity | |
dc.subject | node-Hamiltonian-connectivity | |
dc.subject.other | Computational Biology | |
dc.title | Construction for fault-tolerant Hamiltonian and Hamiltonian-connected graphs | |
分類: | 2001年 NCS 全國計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ncs002001000012.pdf | 233.2 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。