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 chapterArticle in proceedingsResearchpeer-review

    Original languageEnglish
    Title of host publication5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India
    PublisherSpringer
    Publication date2010
    Publication statusPublished - 2010
    SeriesLecture Notes in Computer Science

    Cite this