Residual reliability of P-threshold graphs

DOI10.1016/S0166-218X(02)00296-2MaRDI QIDQ4936504zbMATH OpenOpenAlexFDO

Authors A. A. Chernyak

Publication date 31 January 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(02)00296-2

zbMATH Keywords

complexitygraph algorithmreliabilityresidual connectednessthreshold

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Review text

Let \({\mathcal P}(G)\) be a set of connected subgraphs of a graph \(G\) and let, for each edge \(e\), its reliability \(p(e)\in [0,1]\) be defined. The residual reliability (RR) of \(G\) is the probability of the event that the set of residual edges forms an element of \({\mathcal P}(G)\). In the article under review, the problem of determining the RR is solved for several classes of \(P\)-threshold graphs which have previously been characterized in structural terms by means of the decomposition of graphs into primary components. Actually, linear-time algorithms are provided for all these classes. On the other hand, the author proves that this problem is \(\sharp P\)-complete even in the class of biregular graphs with the probability of failure of each edge equal to 1/2. This implies the same issue for the classes of indecomposable box-threshold and pseudo-threshold graphs.

Recommendations

• Computing residual connectedness reliability for restricted networks
• Graphs with most number of three point induced connected subgraphs
• The Complexity of the Residual Node Connectedness Reliability Problem
• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs
• scientific article; zbMATH DE number 176250

Cites work

• Computing residual connectedness reliability for restricted networks
• scientific article; zbMATH DE number 3977053 (Why is no real title available?)
• scientific article; zbMATH DE number 176250 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2073605 (Why is no real title available?)
• scientific article; zbMATH DE number 3997845 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Once more on matrogenic graphs
• Pseudodomishold graphs
• The Complexity of Enumeration and Reliability Problems
• The Complexity of the Residual Node Connectedness Reliability Problem
• Threshold graphs and related topics

Cited in

(2)

• On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs
• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs

This page was built for publication: Residual reliability of P-threshold graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4936504)