THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY

DOI10.1017/S0269964803171021MaRDI QIDQ4805461zbMATH OpenWikidataFDO

Authors Kin-Ping Hui, Nigel G. Bean, Miro Kraetzl, Dirk P. Kroese

Publication date 2003

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Reliability and life testing (62N05) Monte Carlo methods (65C05) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Estimation of network reliability using graph evolution models
• A Monte Carlo Sampling Plan for Estimating Network Reliability
• Monte Carlo and Markov Chain techniques for network reliability and sampling
• scientific article; zbMATH DE number 742895
• scientific article; zbMATH DE number 3882183

Cited in

(7)

• The cross-entropy method for network reliability estimation
• Fast computation of bounds for two-terminal network reliability
• M-C estimation algorithm for multistate network reliability based on fusion of hierarchical sampling and dynamic sampling
• Finding the probability of infection in an SIR network is NP-hard
• Efficient estimation of distance-dependent metrics in edge-failing networks
• Cooperative cross-entropy method for generating entangled networks
• A new simulation method based on the RVR principle for the rare event network reliability problem

This page was built for publication: THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY

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