A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem
Data Structures and Algorithms
2007-05-23 v1
Abstract
The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability.
Keywords
Cite
@article{arxiv.cs/9809012,
title = {A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem},
author = {David R. Karger},
journal= {arXiv preprint arXiv:cs/9809012},
year = {2007}
}
Comments
To appear in SICOMP