Skip to main content
Conference Proceedings

The exponential time complexity of computing the probability that a graph is connected

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6478 LNCS 192-203
DOI: 10.1007/978-3-642-17493-3_19
9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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 Ω(m/log2 m) for simple graphs of m edges under the Exponential Time Hypothesis. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Husfeldt, T., & Taslaman, N. (2010). The exponential time complexity of computing the probability that a graph is connected. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6478 LNCS, pp. 192–203). https://doi.org/10.1007/978-3-642-17493-3_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free