Pages that link to "Item:Q4739945"
From MaRDI portal
The following pages link to Bounds on the Reliability Polynomial for Shellable Independence Systems (Q4739945):
Displaying 15 items.
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- Chip firing and all-terminal network reliability bounds (Q1040088) (← links)
- Matroid Steiner problems, the Tutte polynomial and network reliability (Q1088995) (← links)
- Homotopy properties of greedoids (Q1101115) (← links)
- Edge-packings of graphs and network reliability (Q1111461) (← links)
- A note on bounding \(k\)-terminal reliability (Q1186804) (← links)
- Chromatic polynomials and order ideals of monomials (Q1584366) (← links)
- Sixty years of network reliability (Q1616159) (← links)
- Bouquets of geometric lattices: Some algebraic and topological aspects (Q1812586) (← links)
- The complexity of computing the Tutte polynomial on transversal matroids (Q1842565) (← links)
- Non-Stanley bounds for network reliability (Q1906250) (← links)
- An Evolution Model for Monte Carlo Estimation of Equilibrium Network Renewal Parameters (Q3416063) (← links)
- Counting almost minimum cutsets with reliability applications (Q3768663) (← links)
- Information security: Designing a stochastic-network for throughput and reliability (Q5305565) (← links)
- Network reliability: Heading out on the highway (Q6087070) (← links)