Approximate Counting of Matchings in (3,3)-Hypergraphs
From MaRDI portal
Publication:3188911
DOI10.1007/978-3-319-08404-6_33zbMath1416.68205arXiv1402.6190OpenAlexW2962777859MaRDI QIDQ3188911
Andrzej Ruciński, Edyta Szymańska, Andrzej Dudek, Marek Karpinski
Publication date: 2 September 2014
Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.6190
Hypergraphs (05C65) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (2)
Smoothed counting of 0–1 points in polyhedra ⋮ Counting hypergraph matchings up to uniqueness threshold
This page was built for publication: Approximate Counting of Matchings in (3,3)-Hypergraphs