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

  • Steve Chien

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

Published by SIAM

Publication

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