Chip firing and all-terminal network reliability bounds
From MaRDI portal
Publication:1040088
DOI10.1016/j.disopt.2009.05.003zbMath1179.90317OpenAlexW2023058821MaRDI QIDQ1040088
Richard J. Nowakowski, Jason I. Brown, Charles J. Colbourn
Publication date: 23 November 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2009.05.003
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- What can be said about pure O-sequences?
- Face number inequalities for matroid complexes and Cohen-Macaulay types of Stanley-Reisner rings of distributive lattices
- Hilbert functions of graded algebras
- Chip-firing and the critical group of a graph
- On the log concavity of reliability and matroidal sequences
- Chip firing and the Tutte polynomial
- On the sandpile group of dual graphs
- The Tutte polynomial as a growth function
- Combinatorics and commutative algebra.
- Non-Stanley bounds for network reliability
- Matroid inequalities
- Calculating bounds on reachability and connectedness in stochastic networks
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Roots of the Reliability Polynomials
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Matroids and a Reliability Analysis Problem
- Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
- On the computational complexity of the Jones and Tutte polynomials
- Bounds on the Reliability Polynomial for Shellable Independence Systems
- Cohen–Macaulay Rings in Network Reliability
- Network transformations and bounding network reliability
- Random Graphs
- A generalization of a combinatorial theorem of macaulay
- Network reliability analysis: Part I
