no code implementations • 31 May 2018 • Andreas Björklund, Brajesh Gupt, Nicolás Quesada
We introduce new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops.
Data Structures and Algorithms Quantum Physics
1 code implementation • 22 Jul 2011 • Andreas Björklund
We show that there is a polynomial space algorithm that counts the number of perfect matchings in an $n$-vertex graph in $O^*(2^{n/2})\subset O(1. 415^n)$ time.
Data Structures and Algorithms
