FPRAS for computing a lower bound for weighted matching polynomial of graphs

Details FPRAS for computing a lower bound for weighted matching polynomial of graphs FPRAS for computing a lower bound for weighted matching polynomial of graphs

2007-03-06

arxiv.org/abs/cs/0703029v2

Computer Science

Computational Complexity

16 pages

Scientific paper

We give a fully polynomial randomized approximation scheme to compute a lower
bound for the matching polynomial of any weighted graph at a positive argument.
For the matching polynomial of complete bipartite graphs with bounded weights
these lower bounds are asymptotically optimal.

Affiliated with

Also associated with

No associations

Rating

FPRAS for computing a lower bound for weighted matching polynomial of 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 FPRAS for computing a lower bound for weighted matching polynomial of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and FPRAS for computing a lower bound for weighted matching polynomial of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-254593