https://scholars.lib.ntu.edu.tw/handle/123456789/116799
標題: | Embed longest rings onto star graphs with vertex faults | 作者: | Hsieh, Sun-Yuan GEN-HUEY CHEN Ho, Chin-Wen |
公開日期: | 八月-1998 | 起(迄)頁: | - | 來源出版物: | 1998 International Conference on Parallel Processing | 摘要: | The star graph has been recognized as an attractive alternative to the hypercube. Let Fe and Fν be the sets of vertex faults and edge faults, respectively. Previously, Tseng et al. showed that an n-dimensional star graph can embed a ring of length n! if |Fe|≤n-3 (|Fν|=0), and a ring of length at least n!-4|Fν| if |Fν|≤n-3 (|Fe|=0). Since an n-dimensional star graph is regular of degree n-1 and is bipartite with two partite sets of equal size, our result achieves optimality in the worst case. © 1998 IEEE. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0002241611&doi=10.1109%2fICPP.1998.708473&partnerID=40&md5=51f91f6eecf458399dccdeeabf2a709f | 其他識別: | N/A | DOI: | 10.1109/ICPP.1998.708473 | SDG/關鍵字: | A-RINGS; Edge faults; Equal sizes; Hypercube; Optimality; Partite sets; Star graphs |
顯示於: | 資訊工程學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
00708473.pdf | 81.39 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。