We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
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 graph
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.