Recognition: unknown
Approximate Counting of Matchings in Sparse Hypergraphs
classification
💻 cs.DS
cs.DM
keywords
hypergraphsmatchingsmethodsparseuniformapproximateapproximationbelonging
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.