### 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 |

### 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 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Engineering(all)

### Cite this

*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.*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 -