Non-Stanley Bounds for Network Reliability

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Journal of Algebraic Combinatorics

• Publication date

  1996-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1022484229443
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the Log Concavity of Reliability and Matroidal Sequences

  1994cited by this paper
• Network transformations and bounding network reliability

  1993cited by this paper
• Roots of the Reliability Polynomial

  1992cited by this paper
• Face number inequalities for matroid complexes and Cohen‐Macaulay types of Stanley‐Reisner rings of distributive lattices

  1991cited by this paper
• Least reliable networks and the reliability domination

  1990cited by this paper
• Matroid Steiner problems, the Tutte polynomial and network reliability

  1989cited by this paper
• A Set System Polynomial with Colouring and Reliability Applications

  1988cited by this paper
• The Combinatorics of Network Reliability

  1987influential reference
• Combinatorics and commutative algebra

  1983cited by this paper
• Bounds on the reliability polynomial for shellable independence systems

  1982cited by this paper
• A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes

  1981cited by this paper
• Cohen-Macaulay Complexes

  1977cited by this paper
• A ring in graph theory

  1947cited by this paper
• Some Properties of Enumeration in the Theory of Modular Systems

  year unknowncited by this paper

• Network Robustness Based on Inverse Percolation

  2021cites this paper
• Assessing the reliability polynomial based on percolation theory

  2017cites this paper
• Estimating reachability in dense biological networks

  2015cites this paper
• Reachability Analysis in Probabilistic Biological Networks

  2015cites this paper
• Diameter-Constrained Reliability: Complexity, Factorization and Exact computation in Weak Graphs

  2014cites this paper
• Monte Carlo methods in diameter-constrained reliability

  2014cites this paper
• Large scale analysis of signal reachability

  2014influential citation
• PReach: Reachability in Probabilistic Signaling Networks

  2013cites this paper
• Reachability analysis in large probabilistic biological networks

  2013cites this paper
• Chip firing and all-terminal network reliability bounds

  2009cites this paper
• Exact solutions for the two- and all-terminal reliabilities of a simple ladder network

  2006cites this paper
• Exact solutions for the two- and all-terminal reliabilities of the Brecht-Colbourn ladder and the generalized fan

  2006cites this paper
• Lower Bounds for h-Vectors ofk-CM, Independence, and Broken Circuit Complexes

  2004cites this paper
• The k-fractal of a simplicial complex

  2004cites this paper
• Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients

  2002influential citation
• Reliability Polynomials and Their Asymptotic Limits for Families of Graphs

  2002cites this paper
• Chromatic polynomials and order ideals of monomials

  1998cites this paper
• Reliability Polynomials: A Survey

  1998cites this paper
• Zeros of Reliability Polynomials and f-vectors of Matroids

  1998influential citation
• Cohen-Macaulay Rings in Network Reliability

  1996cites this paper