Algebraic Methods Applied to Network Reliability Problems

DOI10.1137/0608022MaRDI QIDQ3758857zbMATH OpenOpenAlexFDO

Authors D. E. Whited, Douglas R. Shier

Publication date 1987

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0608022

zbMATH Keywords

directed networksalgorithmdirected graphnetwork reliabilityreliability polynom

Mathematics Subject Classification ID

Reliability and life testing (62N05) Directed graphs (digraphs), tournaments (05C20) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 176263
• scientific article; zbMATH DE number 4085390
• scientific article; zbMATH DE number 49666
• scientific article; zbMATH DE number 4045097
• An Algorithm for Network Reliability Bounds
• scientific article; zbMATH DE number 919112
• Some Lattice-Theoretic Tools for Network Reliability Analysis
• scientific article; zbMATH DE number 1482700

Cites work

• scientific article; zbMATH DE number 3989126 (Why is no real title available?)
• scientific article; zbMATH DE number 3591262 (Why is no real title available?)
• A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• A Survey of Network Reliability and Domination Theory
• A decomposition algorithm for optimality problems in tree-structured networks
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
• An Algebra for Network Routing Problems
• Complexity of network reliability computations
• Computing the Reliability of Complex Networks
• Fast Algorithms for Solving Path Problems
• Network Reliability and Inner-Four-Cycle-Free Graphs
• Network reliability analysis using 2-connected digraph reductions
• Network reliability and the factoring theorem
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
• Recursive Disjoint Products: A Review of Three Algorithms
• Sequential Bounding of the Reliability of a Stochastic Network
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Enumeration and Reliability Problems

Cited in

(14)

• Some Lattice-Theoretic Tools for Network Reliability Analysis
• scientific article; zbMATH DE number 4085390 (Why is no real title available?)
• scientific article; zbMATH DE number 49666 (Why is no real title available?)
• Adaptive statistical algorithms in network reliability analysis
• scientific article; zbMATH DE number 3869234 (Why is no real title available?)
• scientific article; zbMATH DE number 31759 (Why is no real title available?)
• Algebraic analysis of multiple faults in combinational networks
• scientific article; zbMATH DE number 919112 (Why is no real title available?)
• Using the Decomposition Tree for Directed-Network Reliability Computation
• scientific article; zbMATH DE number 176263 (Why is no real title available?)
• A ternary-arithmetic topological based algebraic method for networks traffic observability
• A Philosophy for Allocating Component Reliabilities in a Network
• Reliability of directed networks using the factoring theorem
• Network reliability: Heading out on the highway

This page was built for publication: Algebraic Methods Applied to Network Reliability Problems

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