Residual reliability of P-threshold graphs
From MaRDI portal
Publication:4936504
DOI10.1016/S0166-218X(02)00296-2zbMath0930.05089MaRDI QIDQ4936504
Publication date: 31 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C90: Applications of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item