Parameterized and Exact Computation
Springer, Berlin, Heidelberg
Chapter title |
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected
|
---|---|
Chapter number | 19 |
Book title |
Parameterized and Exact Computation
|
Published in |
arXiv, December 2010
|
DOI | 10.1007/978-3-642-17493-3_19 |
Book ISBNs |
978-3-64-217492-6, 978-3-64-217493-3
|
Authors |
Thore Husfeldt, Nina Taslaman |
Country | Count | As % |
---|---|---|
Unknown | 7 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 2 | 29% |
Lecturer | 2 | 29% |
Professor > Associate Professor | 1 | 14% |
Researcher | 1 | 14% |
Unknown | 1 | 14% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 57% |
Mathematics | 1 | 14% |
Agricultural and Biological Sciences | 1 | 14% |
Unknown | 1 | 14% |