Fault-tolerant Maximal Local-Connectivity on the Bubble-sort Graphs

檔案

本條目沒有附加檔案。

日期

2009

期刊名稱

PROCEEDINGS OF THE 2009 SIXTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, VOLS 1-3

卷期與頁次

頁 564–569

ISBN

978-1-4244-3770-2

語言

英文

摘要

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.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

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

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/17009