The following pages link to (Q5002746):
Displaying 6 items.
- A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem (Q2753004) (← links)
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem (Q4268894) (← links)
- (Q4496339) (← links)
- Tight bounds for popping algorithms (Q5136919) (← links)
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability (Q5232317) (← links)
- An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks (Q5288661) (← links)