Sciweavers

Share
CORR
2012
Springer

Approximate Counting of Matchings in Sparse Hypergraphs

7 years 6 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
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.
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Added 20 Apr 2012
Updated 20 Apr 2012
Type Journal
Year 2012
Where CORR
Authors Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Comments (0)
books