Nina Sofia Taslaman
IT University of Copenhagen
Rued Langgaards Vej 7
DK-2300 Copenhagen S
Denmark
Information Desk: 72185000
- 2010
- Published
The exponential time complexity of computing the probability that a graph is connected
Husfeldt, T. & Taslaman, N. S., 2010, 5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India. Springer, (Lecture Notes in Computer Science).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
ID: 1012044