Bounds on the Reliability Polynomial for Shellable Independence Systems

DOI10.1137/0603016MaRDI QIDQ4739945zbMATH OpenOpenAlexFDO

Authors 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 networksreachability in graphsreliability analysisshellable independence system

Mathematics Subject Classification ID

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

Cites work

• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
• A Reliability Bound for Systems of Maintained, Interdependent Components
• Balanced Cohen-Macaulay Complexes
• Complexity of network reliability computations
• Computing Network Reliability
• Computing the Reliability of Complex Networks
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• scientific article; zbMATH DE number 3345859 (Why is no real title available?)
• Matroids and a Reliability Analysis Problem
• Multi-Component Systems and Structures and Their Reliability
• Network Flow and Testing Graph Connectivity
• Network reliability analysis: Part I
• Shellable Decompositions of Cells and Spheres.
• Shellings of spheres and polytopes
• Some matroid inequalities
• The Complexity of Enumeration and Reliability Problems
• The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds

Cited in

(16)

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

This page was built for publication: Bounds on the Reliability Polynomial for Shellable Independence Systems

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