@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 F{\"u}rer and Kasiviswanathan, {Shiva Prasad}",

year = "2005",

month = dec,

day = "1",

language = "English (US)",

isbn = "0898715962",

series = "Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics",

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",

note = "Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics ; Conference date: 22-01-2005 Through 22-01-2005",

}