A determinant-based algorithm for counting perfect matchings in a general graph
Steve Chien
January 2004
 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 |
©2009 Microsoft Corporation. All rights reserved.