Simple deterministic approximation algorithms for counting matchings
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
Suppose we cover the set of vertices of a graph $G$ by non-overlapping monomers (singleton sets) and dimers (pairs of vertices corresponding to an edge). Each way to do this is called a monomer-dimer configuration. If $G$ is finite and $\lambda