The Exponential Time Complexity of Computing the Probability That a Graph is Connected
Computational Complexity
2015-05-19 v3
Abstract
We show that for every probability p with 0 < p < 1, computation of all-terminal graph reliability with edge failure probability p requires time exponential in Omega(m/ log^2 m) for simple graphs of m edges under the Exponential Time Hypothesis.
Cite
@article{arxiv.1009.2363,
title = {The Exponential Time Complexity of Computing the Probability That a Graph is Connected},
author = {Thore Husfeldt and Nina Taslaman},
journal= {arXiv preprint arXiv:1009.2363},
year = {2015}
}
Comments
To appear in 5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13-15, 2010, Chennai, India, Springer LNCS, 2010