@article{38d3d8270dbc4a348c0275d492d388d2,
title = "A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability",
abstract = "We give a fully polynomial-time randomized approximation scheme (FPRAS) for the all-terminal network reliability problem, which is to determine the probability that, in a undirected graph, assuming each edge fails independently, the remaining graph is still connected. Our main contribution is to confirm a conjecture by Gorodezky and Pak (Random Struct. Algorithms, 2014), that the expected running time of the “cluster-popping” algorithm in bi-directed graphs is bounded by a polynomial in the size of the input.",
author = "Heng Guo and Mark Jerrum",
year = "2019",
month = may,
day = "9",
doi = "10.1137/18M1201846",
language = "English",
volume = "48",
pages = "964–978",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "3",
}