Approximate Counting of Matchings in Sparse Hypergraphs
Data Structures and Algorithms
2012-04-06 v2 Discrete Mathematics
Abstract
In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hypergraphs. Our method is based on a generalization of the canonical path method to the case of uniform hypergraphs.
Cite
@article{arxiv.1202.5885,
title = {Approximate Counting of Matchings in Sparse Hypergraphs},
author = {Marek Karpinski and Andrzej Rucinski and Edyta Szymanska},
journal= {arXiv preprint arXiv:1202.5885},
year = {2012}
}