Fault-Tolerant Maximal Local-Connectivity on the Bubble-Sort Graphs

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Lun-Min Shih, Tan, J.J.M.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Bubble-sort graph Cities and towns Computer science Connectivity Fault tolerance Fault-tolerant Hypercubes Information technology Interconnection networks Local connectivity Multiprocessor interconnection networks Size measurement Topology Tree graphs
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!