Algebraic Methods Applied to Network Reliability Problems

DOI10.1137/0608022zbMath0622.05031OpenAlexW2019055475MaRDI QIDQ3758857

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

algorithmdirected graphnetwork reliabilitydirected networksreliability polynom

Mathematics Subject Classification ID

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

Related Items (1)

Network reliability: Heading out on the highway

Cites Work

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

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