Cycles in highly faulty hypercubes
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
107 | en_US |
dc.citation.spage |
101 | en_US |
dc.contributor.author |
Yang, MC | en_US |
dc.contributor.author |
Tan, JJM | en_US |
dc.contributor.author |
Hsu, LH | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:25:28Z | |
dc.date.available |
2014-12-08T15:25:28Z | |
dc.date.issued |
2005 | en_US |
dc.description.abstract |
The hypercube Q(n) is one of the most popular networks. In, this paper, we first prove that the n-dimensional hypercube is 2n - 5 conditional fault- bipancyclic. That is, an injured hypercube with up to 2n - 5 faulty links has a cycle of length I for every even 4 <= l <= 2(n) when each node of the hypercube is incident with at least two healthy links. In addition, if a certain node is incident with less than two healthy links, we show that an injured hypercube contains cycles of all even lengths except hamiltonian cycles with up to 2n - 3 faulty links. Furthermore, the above two results are optimal. In conclusion, we find cycles of all possible lengths in injured hypercubes with up to 2n - 5 faulty links under all possible fault distributions. | en_US |
dc.identifier.isbn |
1-932415-71-8 | en_US |
dc.identifier.journal |
FCS '05: Proceedings of the 2005 International Conference on Foundations of Computer Science | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/17875 | |
dc.identifier.wosnumber |
WOS:000236726300015 | |
dc.language.iso |
en_US | en_US |
dc.subject |
cycle embedding | en_US |
dc.subject |
hypercube | en_US |
dc.subject |
bipancyclic | en_US |
dc.subject |
conditional | en_US |
dc.subject |
fault tolerance | en_US |
dc.title |
Cycles in highly faulty hypercubes | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文