Fault-tolerant Maximal Local-Connectivity on the Bubble-sort Graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
569 | en_US |
dc.citation.spage |
564 | en_US |
dc.contributor.author |
Shih, Lun-Min | en_US |
dc.contributor.author |
Tan, Jimmy J. M. | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:24:33Z | |
dc.date.available |
2014-12-08T15:24:33Z | |
dc.date.issued |
2009 | en_US |
dc.description.abstract |
An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. The local connectivity of two vertices is defined as the maximum number of internally vertex-disjoint paths between them. In this paper, we define two vertices to be maximally local-connected, if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vertices. Moreover, we introduce the one-to-many version of connectivity. We show that an n-dimensional Bubble-sort Graph is maximally local-connected, even if there are at most n-3 faulty vertices in it, and prove that it is also (n-1)-fault-tolerant one-to-many maximally local-connected. | en_US |
dc.identifier.isbn |
978-1-4244-3770-2 | en_US |
dc.identifier.journal |
PROCEEDINGS OF THE 2009 SIXTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, VOLS 1-3 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/17009 | |
dc.identifier.wosnumber |
WOS:000270815100098 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Interconnection networks | en_US |
dc.subject |
Bubble-sort graph | en_US |
dc.subject |
Connectivity | en_US |
dc.subject |
Fault-tolerant | en_US |
dc.subject |
Local connectivity | en_US |
dc.title |
Fault-tolerant Maximal Local-Connectivity on the Bubble-sort Graphs | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Shih, L.-M., & Tan, J. J. M. (2009). Fault-tolerant Maximal Local-Connectivity on the Bubble-sort Graphs. PROCEEDINGS OF THE 2009 SIXTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, VOLS 1-3, 564–569. https://ir.lib.nycu.edu.tw/handle/11536/17009
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/17009