Matchings in lattice graphs

DOI10.1145/167088.167278zbMath1310.68242OpenAlexW1986137624MaRDI QIDQ5248545

Dana Randall, Alistair Sinclair, Claire M. Kenyon

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167278

Mathematics Subject Classification ID

Trees (05C05) Approximation algorithms (68W25)

Related Items (1)

Approximating the number of monomer-dimer coverings of a lattice.

This page was built for publication: Matchings in lattice graphs