By Topic

An O(n×log(n)) algorithm to compute the all-terminal reliability of (K5, K 2.2.2) free networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
T. Politof ; Dept. of Decision Sci., Concordia Univ., Montreal, Que., Canada ; A. Satyanarayana ; L. Tung

A graph is (K5, K2.2.2) free if it has no subgraph contractible to K5 or K2.2.2. The class of partial 3-trees (also known as Y-Δ graphs) is a proper subset of (K5, K 2.2.2) free graphs. Let G be a network with perfectly reliable points and edges that fail independently with some known probabilities. The all-terminal reliability R(G) of G is the probability that G is connected. Computing R(G) for a general network is NP-hard. This paper presents an O(n log n) algorithm to compute R(G) of any (K5, K2.2.2) free graphs on n points. The running time of this algorithm is O(n) if G is planar

Published in:

IEEE Transactions on Reliability  (Volume:41 ,  Issue: 4 )