Algorithms for Generating Minimal Cutsets by Inversion

DOI10.1109/TR.1985.5222173MaRDI QIDQ3686410zbMATH OpenFDO

Authors D. E. Whited, Douglas R. Shier

Publication date 1985

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

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

zbMATH Keywords

Computational resultsminimal cutsetsinverting minimal pathss-coherent systems

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Inverting Paths & Cuts of 2-State Systems
• A New Technique in Minimal Path and Cutset Evaluation
• scientific article; zbMATH DE number 1234600
• Iterative algorithms for generating minimal cutsets in directed graphs
• scientific article; zbMATH DE number 857424

Cited in

(6)

• Iterative algorithms for generating minimal cutsets in directed graphs
• Fast computation of bounds for two-terminal network reliability
• A simple algorithm to search for all MCs in networks
• Parametric max flow problems in a class of networks with series-parallel structure
• Inverting Paths & Cuts of 2-State Systems
• Minimal cut sets of a coherent fault tree generation using reverse Petri nets

This page was built for publication: Algorithms for Generating Minimal Cutsets by Inversion

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