A determinant-based algorithm for counting perfect matchings in a general graph

Steve Chien. A determinant-based algorithm for counting perfect matchings in a general graph. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004. pages 728-735, SIAM, 2004. [doi]

Abstract

Abstract is missing.