scientific article; zbMATH DE number 176260

zbMATH Open0766.60025MaRDI QIDQ4035367FDOQ4035367

Authors: András Prékopa, Endre Boros, Keh-Wei Lih 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• Bounding network-reliability using consecutive minimal cutsets
• Improving reliability bounds in computer networks
• scientific article; zbMATH DE number 828011
• Lower bounds on two-terminal network reliability

zbMATH Keywords

numerical examplesnetwork reliabilityinclusion-exclusion formula

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15)

Cited In (7)

• Title not available (Why is that?)
• An Alternate Approach to Compute the Reliability of a Computer Communication Network Using Binary Decision Diagrams
• On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
• Bounds of two-terminal network reliability and base spectrum of network graph
• Improved bounds on the probability of the union of events some of whose intersections are empty
• New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
• The value of shape constraints in discrete moment problems: a review and extension

This page was built for publication:

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