A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs

Details A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs

2006-07-28

arxiv.org/abs/cs/0607135v1

Computer Science

Computational Complexity

6 pages

Scientific paper

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can construct a bipartite $G_k$. For bipartite graphs this result implies that the number of $k$-matching has a polynomial-time approximation algorithm. The above results are extended to permanents and hafnians of corresponding matrices.

Affiliated with

Also associated with

No associations

Rating

A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs 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 A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-250576