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

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!