FPRAS for computing a lower bound for weighted matching polynomial of graphs
<|reference_start|>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.<|reference_end|>
@article{friedland2007fpras,
    title={FPRAS for computing a lower bound for weighted matching polynomial of
  graphs},
    author={Shmuel Friedland},
    journal={arXiv preprint arXiv:cs/0703029},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0703029},
    primaryClass={cs.CC cs.DM}
}