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

DOI10.1016/S0166-218X(98)00027-4zbMath0905.90082MaRDI QIDQ1392544

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

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 graphperformabilitystochastic PERTflow networks

Mathematics Subject Classification ID

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

Cites Work

• Exact cuts in networks
• The Complexity of Enumeration and Reliability Problems
• Threshold reliability of networks with small failure sets
• Unnamed Item
• Unnamed Item

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