Computer Science – Computational Complexity
Scientific paper
2007-11-12
Computer Science
Computational Complexity
18 pages
Scientific paper
Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach (RM) to approximate the permanent, which just yields a critical ratio O($n\omega(n)$) for almost all the 0-1 matrices, provided it's a simple promising practical way to compute this #P-complete problem. In this paper, the performance of this method will be shown when it's applied to compute all the matchings based on that transformation. The critical ratio will be proved to be very large with a certain probability, owning an increasing factor larger than any polynomial of $n$ even in the sense for almost all the 0-1 matrices. Hence, RM fails to work well when counting all the matchings via computing the permanent of the matrix. In other words, we must carefully utilize the known methods of estimating the permanent to count all the matchings through that transformation.
Bai Fengshan
Huo Yan
Zhang Jinshan
No associations
LandOfFree
An analysis of a random algorithm for estimating all the matchings 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 An analysis of a random algorithm for estimating all the matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An analysis of a random algorithm for estimating all the matchings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-128453