1 citations · 1 across the 1 of their papers we have counts for
3 papers
Approximate Counting of Matchings in -Hypergraphs
Andrzej Dudek, Marek Karpinski, Andrzej Ruciński +1
We design a fully polynomial time approximation scheme (FPTAS) for counting the number of matchings (packings) in arbitrary 3-uniform hypergraphs of maximum degree three, referred…
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…
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.…