scientific article; zbMATH DE number 4097115

MaRDI QIDQ3823399zbMATH OpenFDO

Authors D. E. Whited, Douglas R. Shier

Publication date 1988

zbMATH Keywords

computer communication systemsdirected graphnetwok reliabilitys-t reliabilitysequence of matched lower and upper boundssourceterminal vertexunreliable edges

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Improving reliability bounds in computer networks
• Reliability Computations for Planar Networks
• Bounding the Reliability of Networks
• A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
• Series-Parallel Bounds for the Two-Terminal Reliability Problem

Cited in

(25)

• The complexity of the reliable connectivity problem
• The cross-entropy method for network reliability estimation
• A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
• On the reliability of series-parallel networks in grid graphs
• High-confidence estimation of small s-t reliabilities in directed acyclic networks
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• scientific article; zbMATH DE number 4145632 (Why is no real title available?)
• scientific article; zbMATH DE number 4167819 (Why is no real title available?)
• Stochastic and deterministic characteristics of recursively defined networks
• Calculating bounds on reachability and connectedness in stochastic networks
• scientific article; zbMATH DE number 3912072 (Why is no real title available?)
• scientific article; zbMATH DE number 3960829 (Why is no real title available?)
• Bounds on the Reliability of Networks
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• Improving reliability bounds in computer networks
• scientific article; zbMATH DE number 26483 (Why is no real title available?)
• Bounding the Reliability of Networks
• Series-Parallel Bounds for the Two-Terminal Reliability Problem
• Reliability Computations for Planar Networks
• scientific article; zbMATH DE number 176146 (Why is no real title available?)
• scientific article; zbMATH DE number 176263 (Why is no real title available?)
• scientific article; zbMATH DE number 1218894 (Why is no real title available?)
• Threshold reliability of networks with small failure sets
• scientific article; zbMATH DE number 5173840 (Why is no real title available?)

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 Q3823399)