Approximate Counting of Matchings in Sparse Hypergraphs

Details Approximate Counting of Matchings in Sparse Hypergraphs Approximate Counting of Matchings in Sparse Hypergraphs

2012-02-27

arxiv.org/abs/1202.5885v2

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Approximate Counting of Matchings in Sparse Hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate Counting of Matchings in Sparse Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Counting of Matchings in Sparse Hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263274