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

Thore Husfeldt, Nina Sofia Taslaman

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Original language	English
Title of host publication	5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India
Publisher	Springer
Publication date	2010
Publication status	Published - 2010

Series	Lecture Notes in Computer Science

Cite this

@inproceedings{1cb35c34bcbe4ae09de202766e781d4f,

title = "The exponential time complexity of computing the probability that a graph is connected",

author = "Thore Husfeldt and Taslaman, {Nina Sofia}",

year = "2010",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

booktitle = "5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India",

address = "Germany",

}

The exponential time complexity of computing the probability that a graph is connected. / Husfeldt, Thore; Taslaman, Nina Sofia .
5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India. Springer, 2010. (Lecture Notes in Computer Science).

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

TY - GEN

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

AU - Husfeldt, Thore

AU - Taslaman, Nina Sofia

PY - 2010

Y1 - 2010

M3 - Article in proceedings

T3 - Lecture Notes in Computer Science

BT - 5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India

PB - Springer

ER -