计算图的加权匹配多项式下界的FPRAS
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
