- 期刊
- OpenAccess
Largest Connected Component of a k-ary n-cube with Faulty Vertices
並列摘要
The k-ary n-cube is one of the most popular interconnection networks for parallel computing. This paper addresses the size of a largest connected component of a faulty k-ary n-cube. We prove that, in a k-ary n-cube (k ≥ 4 and n ≥ 2) with up to 4n-2 faulty vertices, all fault-free vertices but at most two constitute a connected component. Moreover, this assertion holds if and only if the set of all faulty vertices is equal to the neighborhood of a pair of fault-free adjacent vertices.
被引用紀錄
Lu, Y. T. (2016). 自動乳房超音波之電腦輔助腫瘤診斷 [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU201603097
Chu, Y. H. (2015). 3D 乳房彈性超音波之電腦腫瘤診斷 [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2015.00873
Chang, F. C. (2014). 以正規邏輯方法解決中文文本蘊含辨識問題 [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2014.01460
Hong, J. F. (2010). 詞義預測研究：以語料庫驅動的語言學研究方法 [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2010.02757
Lin, C. J. (2004). 中文開放領域自動問答系統之研究 [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2004.01539