### 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 language | English (US) |
---|---|

Title of host publication | Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics |

Editors | C. Demetrescu, R. Sedgewick, R. Tamassia |

Pages | 263-272 |

Number of pages | 10 |

State | Published - Dec 1 2005 |

Event | Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics - Vancouver, BC, Canada Duration: Jan 22 2005 → Jan 22 2005 |

### Publication series

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

### Other

Other | Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics |
---|---|

Country | Canada |

City | Vancouver, BC |

Period | 1/22/05 → 1/22/05 |

### All Science Journal Classification (ASJC) codes

- Engineering(all)

## Fingerprint Dive into the research topics of 'Approximately counting perfect matchings in general graphs'. Together they form a unique fingerprint.

## Cite this

Fürer, 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). (Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics).