FPRAS for computing a lower bound for weighted matching polynomial of graphs
Computational Complexity
2007-05-23 v2 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.cs/0703029,
title = {FPRAS for computing a lower bound for weighted matching polynomial of graphs},
author = {Shmuel Friedland},
journal= {arXiv preprint arXiv:cs/0703029},
year = {2007}
}
Comments
16 pages