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

Thore Husfeldt; Nina Sofia  Taslaman

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

Thore Husfeldt, Nina Sofia Taslaman

Computer Science

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Originalsprog	Engelsk
Titel	5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India
Forlag	Springer
Publikationsdato	2010
Status	Udgivet - 2010

Navn	Lecture Notes in Computer Science

Citationsformater

@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).

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › 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 -