Two-path subsets: Efficient counting and applications to performability analysis

DOI10.1016/S0166-218X(98)00027-4MaRDI QIDQ1392544zbMATH OpenFDO

Authors Michael O. Ball, Jane N. Hagstrom, J. Scott Provan

Publication date 28 July 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

enumerationplanar graphstochastic PERTflow networksperformability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Paths and cycles (05C38) Stochastic network models in operations research (90B15)

Recommendations

• Reliability Computations for Planar Networks
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• Threshold reliability of networks with small failure sets
• Guaranteed capacity of a two-pole network with unreliable elements: Probability computation

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 176261 (Why is no real title available?)
• Exact cuts in networks
• The Complexity of Enumeration and Reliability Problems
• Threshold reliability of networks with small failure sets

This page was built for publication: Two-path subsets: Efficient counting and applications to performability analysis

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