Algebraic Methods Applied to Network Reliability Problems
From MaRDI portal
Publication:3758857
DOI10.1137/0608022zbMATH Open0622.05031OpenAlexW2019055475MaRDI QIDQ3758857FDOQ3758857
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
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
Reliability and life testing (62N05) Directed graphs (digraphs), tournaments (05C20) Applications of graph theory to circuits and networks (94C15)
Cites Work
- A Survey of Network Reliability and Domination Theory
- Title not available (Why is that?)
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Complexity of Enumeration and Reliability Problems
- An Algebra for Network Routing Problems
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
- Recursive Disjoint Products: A Review of Three Algorithms
- A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
- Network reliability and the factoring theorem
- Title not available (Why is that?)
- Computing the Reliability of Complex Networks
- Complexity of network reliability computations
- Fast Algorithms for Solving Path Problems
- An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
- Network Reliability and Inner-Four-Cycle-Free Graphs
- A decomposition algorithm for optimality problems in tree-structured networks
- Sequential Bounding of the Reliability of a Stochastic Network
- Network reliability analysis using 2-connected digraph reductions
Cited In (14)
- Some Lattice-Theoretic Tools for Network Reliability Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adaptive statistical algorithms in network reliability analysis
- Title not available (Why is that?)
- Algebraic analysis of multiple faults in combinational networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Using the Decomposition Tree for Directed-Network Reliability Computation
- Title not available (Why is that?)
- 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)
