Bounds on the Reliability Polynomial for Shellable Independence Systems

DOI10.1137/0603016zbMath0504.05053OpenAlexW1980331282MaRDI QIDQ4739945

Michael O. Ball, J. Scott Provan

Publication date: 1982

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

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

zbMATH Keywords

communication networksreliability analysisreachability in graphsshellable independence system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items

Sixty years of network reliability, Matroid Steiner problems, the Tutte polynomial and network reliability, Homotopy properties of greedoids, Information security: Designing a stochastic-network for throughput and reliability, Non-Stanley bounds for network reliability, Edge-packings of graphs and network reliability, Counting almost minimum cutsets with reliability applications, Network reliability: Heading out on the highway, A note on bounding \(k\)-terminal reliability, Reliable assignments of processors to tasks and factoring on matroids, Bouquets of geometric lattices: Some algebraic and topological aspects, Chip firing and all-terminal network reliability bounds, An Evolution Model for Monte Carlo Estimation of Equilibrium Network Renewal Parameters, The complexity of computing the Tutte polynomial on transversal matroids, Chromatic polynomials and order ideals of monomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some matroid inequalities
• Shellings of spheres and polytopes
• Multi-Component Systems and Structures and Their Reliability
• The Complexity of Enumeration and Reliability Problems
• Complexity of network reliability computations
• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
• Network Flow and Testing Graph Connectivity
• Computing the Reliability of Complex Networks
• Matroids and a Reliability Analysis Problem
• Balanced Cohen-Macaulay Complexes
• Computing Network Reliability
• A Reliability Bound for Systems of Maintained, Interdependent Components
• Network reliability analysis: Part I
• Shellable Decompositions of Cells and Spheres.