scientific article; zbMATH DE number 4097115

zbMATH Open0669.90054MaRDI QIDQ3823399FDOQ3823399

Authors: D. E. Whited, Douglas R. Shier 

Publication date: 1988

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

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

zbMATH Keywords

directed graphsourceterminal vertexcomputer communication systemsnetwok reliabilitys-t reliabilitysequence of matched lower and upper boundsunreliable 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)

Cited In (22)

• A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
• On the reliability of series-parallel networks in grid graphs
• Calculating bounds on reachability and connectedness in stochastic networks
• The cross-entropy method for network reliability estimation
• Series-Parallel Bounds for the Two-Terminal Reliability Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on the Reliability of Networks
• Stochastic and deterministic characteristics of recursively defined networks
• Reliability Computations for Planar Networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• Title not available (Why is that?)
• High-confidence estimation of small \(s-t\) reliabilities in directed acyclic networks
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• The complexity of the reliable connectivity problem
• Title not available (Why is that?)
• Improving reliability bounds in computer networks
• Bounding the Reliability of Networks
• Title not available (Why is that?)
• The Complexity of Reliability Computations in Planar and Acyclic Graphs

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)