Residual reliability of P-threshold graphs

DOI10.1016/S0166-218X(02)00296-2zbMath0930.05089OpenAlexW2060165073MaRDI QIDQ4936504

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

complexityreliabilitygraph algorithmthresholdresidual connectedness

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing residual connectedness reliability for restricted networks
• Once more on matrogenic graphs
• Pseudodomishold graphs
• Threshold graphs and related topics
• The Complexity of the Residual Node Connectedness Reliability Problem
• The Complexity of Enumeration and Reliability Problems

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