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

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. 2000 Mathematics Subject Classification: 05A15, 05C70, 15A52, 68Q10. Keywords and phrases: Perfect matchings, k-matchings, permanents, hafnians, weighted matching polynomial of graph, fully polynomial randomized approximation scheme.

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Shmuel Friedland
• Keywords: CORR 2007, Education, Lower Bounds, Matching Polynomial, Polynomial