1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012
Approximate Counting of Matchings in Sparse Uniform Hypergraphs
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of matchings in k-uniform hypergraphs whose intersection graphs contain few claws. O…
cs.DS2012★ 1 cited
Approximate Counting of Matchings in Sparse Hypergraphs
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
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.…