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 \({\it \Omega}(m/\log^2 m)\) for simple graphs of m edges under the Exponential Time Hypothesis.
Partially supported by Swedish Research Council grant VR 2008–2010.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ball, M.O., Colbourn, C.J., Provan, J.S.: Network Reliability. Handbooks in operations research and management science, ch. 11, vol. 7. Elsevier Science, Amsterdam (1995)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), Philadelphia, Pennsylvania, USA, October 25-28, pp. 677–686. IEEE Computer Society, Los Alamitos (2008)
Brylawski, T.H.: The Tutte polynomial. In: Matroid Theory and Its Applications, pp. 125–275. C.I.M.E., Ed. Liguori, Napoli & Birkhäuser (1980)
Buzacott, J.A.: A recursive algorithm for finding reliability measures related to the connection of nodes in a graph. Networks 10(4), 311–327 (1980)
Dell, H., Husfeldt, T., Wahlén, M.: Exponential time complexity of the permanent and the Tutte polynomial. In: Gavoille, C. (ed.) ICALP 2010, Part I. LNCS, vol. 6198, pp. 426–437. Springer, Heidelberg (2010); Full paper in Electronic Colloquium on Computational Complexity, Report No. 78 (2010)
Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2001)
Goldberg, L.A., Jerrum, M.: Inapproximability of the Tutte polynomial. Inform. Comput. 206(7), 908–929 (2008)
Hoffmann, C.: Exponential time complexity of weighted counting of independent sets. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 180–191. Springer, Heidelberg (2010)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)
Jaeger, F., Vertigan, D.L., Welsh, D.J.: On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge 108(1), 35–53 (1990)
Kirchhoff, G.: Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Ann. Phys. Chem. 72, 497–508 (1847)
Kutzkov, K.: New upper bound for the #3-SAT problem. Inf. Process. Lett. 105(1), 1–5 (2007)
Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12(4), 777–788 (1983)
Sekine, K., Imai, H., Tani, S.: Computing the Tutte polynomial of a graph of moderate size. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 224–233. Springer, Heidelberg (1995)
Sokal, A.D.: The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In: Surveys in Combinatorics, pp. 173–226. Cambridge University Press, Cambridge (2005)
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410–421 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Husfeldt, T., Taslaman, N. (2010). The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. In: Raman, V., Saurabh, S. (eds) Parameterized and Exact Computation. IPEC 2010. Lecture Notes in Computer Science, vol 6478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17493-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-17493-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17492-6
Online ISBN: 978-3-642-17493-3
eBook Packages: Computer ScienceComputer Science (R0)