Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation

DOI10.1109/TR.1978.5220267MaRDI QIDQ3876780zbMATH OpenFDO

Authors Stefan Arnborg

Publication date 1978

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TR.1978.5220267

zbMATH Keywords

fault treegraph structurereliability algorithmswitching functions

Mathematics Subject Classification ID

Applications of renewal theory (reliability, demand theory, etc.) (60K10) Reliability and life testing (62N05) Reliability, availability, maintenance, inspection in operations research (90B25)

Cited in

(5)

• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Complexity of Finding Embeddings in a k-Tree
• Graph decompositions and tree automata in reasoning with uncertainty
• Forbidden minors characterization of partial 3-trees

This page was built for publication: Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation

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