Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation

From MaRDI portal

Revision as of 18:50, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3876780

Jump to:navigation, search

DOI10.1109/TR.1978.5220267zbMath0436.60062MaRDI QIDQ3876780

Stefan Arnborg

Publication date: 1978

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

zbMATH Keywords

switching functions graph structure fault tree reliability algorithm

Mathematics Subject Classification ID

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

Related Items (5)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3876780&oldid=17506590"