Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees

4 references·2 citing·16 second hop

FromToDepth

this work references cited by second hop

References

1972New methodology for obtaining cut sets for fault trees119 cited
1975On the Analysis of Fault Trees106 cited
1978FATRAM-A Core Efficient Cut-Set Algorithm37 cited
1977Efficient Construction of Minimal Cut Sets from Fault Trees34 cited

Cited by

1989Structural reliability13 cited
1994Fault trees—Problems and the modern state of investigations11 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work