Share this page
Share this page E-mail this page Print this page RSS feeds
Home > Publications > A determinant-based algorithm for counting perfect matchings in a general graph
A determinant-based algorithm for counting perfect matchings in a general graph

sodatalk.pdf
PDF file

In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA 2004)

Publisher: SIAM

Details

Type: Inproceedings
URL: http://doi.acm.org/10.1145/982903
Pages: 728-735
Address: New Orleans, Louisiana, USA