Computing K-Terminal Reliability of Circular-Arc Graphs

Computing K-Terminal Reliability of Circular-Arc Graphs

Let G be a graph and K be a set of target vertices of G. Assume that all vertices of G, except the vertices in K, may fail with given probabilities. The K-terminal reliability of G is the probability that all vertices in K are mutually connected. This reliability problem is known to be #P-complete f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Information and Systems 2016/12/01, Vol.E99.D(12), pp.3047-3052
Hauptverfasser: CHEN, Chien-Min, LIN, Min-Sheng
Format: Artikel
Sprache:eng
Schlagworte:
algorithm
Algorithms
circular-arc graphs
Circularity
Computation
Graph theory
Graphs
interval graphs
Reliability
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Let G be a graph and K be a set of target vertices of G. Assume that all vertices of G, except the vertices in K, may fail with given probabilities. The K-terminal reliability of G is the probability that all vertices in K are mutually connected. This reliability problem is known to be #P-complete for general graphs. This work develops the first polynomial-time algorithm for computing the K-terminal reliability of circular-arc graphs.
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.2016EDP7221