The following pages link to (Q3718464):
Displaying 12 items.
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false (Q598476) (← links)
- Speeding up computation of the reliability polynomial coefficients for a random graph (Q650005) (← links)
- Generalized activities and \(K\)-terminal reliability (Q1186380) (← links)
- Reliability covering problems for hypergraphs (Q1968515) (← links)
- On the roots of all-terminal reliability polynomials (Q2400560) (← links)
- (Q3090470) (← links)
- Polyhedral Combinatorics and Network Reliability (Q3731354) (← links)
- Counting almost minimum cutsets with reliability applications (Q3768663) (← links)
- (Q3789615) (← links)
- Geometric properties of reliability polynomials (Q4605109) (← links)
- Optimization of the reliability polynomial in presence of mediocre elements (Q5289377) (← links)
- You May Rely on the Reliability Polynomial for Much More Than You Might Think (Q5460671) (← links)