Chip firing and all-terminal network reliability bounds
type: Item
instance of: scholarly article
title: Chip firing and all-terminal network reliability bounds
zbMATH Open document ID: 1179.90317
author: Jason I. Brown
author: Charles J. Colbourn
author: R. J. Nowakowski
published in: Discrete Optimization
publication date: 2009-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 5637334
zbMATH Keywords: all-terminal reliability
zbMATH Keywords: graph
zbMATH Keywords: chip firing
zbMATH Keywords: multicomplex
zbMATH Keywords: \(M\)-partitionable
zbMATH Keywords: \(M\)-shelling
zbMATH Keywords: bounds
MaRDI profile type: Publication
full work available at URL: j.disopt.2009.05.003
OpenAlex ID: W2023058821
cites work: Q5726070
cites work: Q4071752
cites work: Network reliability analysis: Part I
cites work: Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
cites work: Matroids and a Reliability Analysis Problem
cites work: Q3338863
cites work: The Upper Bound Conjecture and Cohen-Macaulay Rings
cites work: Q4153339
cites work: Hilbert functions of graded algebras
cites work: Q3686725
cites work: Bounds on the Reliability Polynomial for Shellable Independence Systems
cites work: Calculating bounds on reachability and connectedness in stochastic networks
cites work: Network transformations and bounding network reliability
cites work: Combinatorics and commutative algebra.
cites work: Roots of the Reliability Polynomials
cites work: On the log concavity of reliability and matroidal sequences
cites work: Non-Stanley bounds for network reliability
cites work: Cohen–Macaulay Rings in Network Reliability
cites work: What can be said about pure O-sequences?
cites work: Face number inequalities for matroid complexes and Cohen-Macaulay types of Stanley-Reisner rings of distributive lattices
cites work: Matroid inequalities
cites work: Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
cites work: Chip-firing and the critical group of a graph
cites work: On the sandpile group of dual graphs
cites work: The Tutte polynomial as a growth function
cites work: Chip firing and the Tutte polynomial
cites work: Q4331212
cites work: Random Graphs
cites work: A generalization of a combinatorial theorem of macaulay
cites work: On the computational complexity of the Jones and Tutte polynomials
DOI: 10.1016/J.DISOPT.2009.05.003
description: scientific article; zbMATH DE number 5637334