Residual reliability of P-threshold graphs

Authors:
A. A. Chernyak
Affiliations:
International Institute of Labour and Social Relations, Home address: ul.Russiyanova, 10, kv. 299, Minsk, Belarus
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 5
Cited 0

Pseudodomishold graphs

Discrete Mathematics
The complexity of the residual node connectedness reliability problem

SIAM Journal on Computing
Computing residual connectedness reliability for restricted networks

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the residual node connectedness network reliability model

On the residual node connectedness network reliability model

Quantified Score

Hi-index	0.04

Visualization

Abstract

We solve the problem of computing the residual reliability (the RES problem) for all classes of P-threshold graphs for which efficient structural characterizations based on decomposition to indecomposable components have been established. In particular, we give a constructive proof of existence of linear algorithms for computing residual reliability of pseudodomishold, domishold, matrogenic and matroidal graphs. On the other hand, we show that the RES problem is #P-complete on the class of biregular graphs, which implies the #P-completeness of the RES problem on the classes of indecomposable box-threshold and pseudothreshold graphs.