2000 character limit reached
Approximate Counting of Matchings in Sparse Hypergraphs
Published 27 Feb 2012 in cs.DS and cs.DM | (1202.5885v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.