Approximately counting perfect matchings in general graphs

Martin Furer, Shiva Prasad Kasiviswanathan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    So far only one approximation algorithm for the number of perfect matchings in general graphs is known. This algorithm of Chien [2] is based on determinants. We present a much simpler algorithm together with some of its variants. One of them has an excellent performance for random graphs, another one might be a candidate for a good worst case performance. We also present an experimental analysis of one of our algorithms.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics
    EditorsC. Demetrescu, R. Sedgewick, R. Tamassia
    Pages263-272
    Number of pages10
    StatePublished - Dec 1 2005
    EventSeventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics - Vancouver, BC, Canada
    Duration: Jan 22 2005Jan 22 2005

    Other

    OtherSeventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics
    CountryCanada
    CityVancouver, BC
    Period1/22/051/22/05

    Fingerprint

    Approximation algorithms

    All Science Journal Classification (ASJC) codes

    • Engineering(all)

    Cite this

    Furer, M., & Kasiviswanathan, S. P. (2005). Approximately counting perfect matchings in general graphs. In C. Demetrescu, R. Sedgewick, & R. Tamassia (Eds.), Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics (pp. 263-272)
    Furer, Martin ; Kasiviswanathan, Shiva Prasad. / Approximately counting perfect matchings in general graphs. Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. editor / C. Demetrescu ; R. Sedgewick ; R. Tamassia. 2005. pp. 263-272
    @inproceedings{9e4c4dfe9be74f89a809ba10c295cbd6,
    title = "Approximately counting perfect matchings in general graphs",
    abstract = "So far only one approximation algorithm for the number of perfect matchings in general graphs is known. This algorithm of Chien [2] is based on determinants. We present a much simpler algorithm together with some of its variants. One of them has an excellent performance for random graphs, another one might be a candidate for a good worst case performance. We also present an experimental analysis of one of our algorithms.",
    author = "Martin Furer and Kasiviswanathan, {Shiva Prasad}",
    year = "2005",
    month = "12",
    day = "1",
    language = "English (US)",
    isbn = "0898715962",
    pages = "263--272",
    editor = "C. Demetrescu and R. Sedgewick and R. Tamassia",
    booktitle = "Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics",

    }

    Furer, M & Kasiviswanathan, SP 2005, Approximately counting perfect matchings in general graphs. in C Demetrescu, R Sedgewick & R Tamassia (eds), Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. pp. 263-272, Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics, Vancouver, BC, Canada, 1/22/05.

    Approximately counting perfect matchings in general graphs. / Furer, Martin; Kasiviswanathan, Shiva Prasad.

    Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. ed. / C. Demetrescu; R. Sedgewick; R. Tamassia. 2005. p. 263-272.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Approximately counting perfect matchings in general graphs

    AU - Furer, Martin

    AU - Kasiviswanathan, Shiva Prasad

    PY - 2005/12/1

    Y1 - 2005/12/1

    N2 - So far only one approximation algorithm for the number of perfect matchings in general graphs is known. This algorithm of Chien [2] is based on determinants. We present a much simpler algorithm together with some of its variants. One of them has an excellent performance for random graphs, another one might be a candidate for a good worst case performance. We also present an experimental analysis of one of our algorithms.

    AB - So far only one approximation algorithm for the number of perfect matchings in general graphs is known. This algorithm of Chien [2] is based on determinants. We present a much simpler algorithm together with some of its variants. One of them has an excellent performance for random graphs, another one might be a candidate for a good worst case performance. We also present an experimental analysis of one of our algorithms.

    UR - http://www.scopus.com/inward/record.url?scp=32144464574&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=32144464574&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 0898715962

    SN - 9780898715965

    SP - 263

    EP - 272

    BT - Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

    A2 - Demetrescu, C.

    A2 - Sedgewick, R.

    A2 - Tamassia, R.

    ER -

    Furer M, Kasiviswanathan SP. Approximately counting perfect matchings in general graphs. In Demetrescu C, Sedgewick R, Tamassia R, editors, Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. 2005. p. 263-272