Approximate Counting via Correlation Decay on Planar Graphs
From MaRDI portal
Publication:5741712
DOI10.1137/1.9781611973105.4zbMath1422.68316arXiv1207.3564OpenAlexW2952156952MaRDI QIDQ5741712
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.3564
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
This page was built for publication: Approximate Counting via Correlation Decay on Planar Graphs
