Approximately Counting Perfect Matchings in General Graphs

Martin Fürer, Shiva Prasad Kasiviswanathan. Approximately Counting Perfect Matchings in General Graphs. In Camil Demetrescu, Robert Sedgewick, Roberto Tamassia, editors, Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. pages 263-272, SIAM, 2005. [doi]

Abstract

Abstract is missing.