We construct a deterministic fully polynomial time approximationscheme (FPTAS) for computing the total number of matchings in abounded degree graph. Additionally, for an arbitrary graph, weconstruct a deterministic algorithm for computing approximately thenumber of matchings within running time exp(O(√n log2n)),where n is the number of vertices.
No takes yet. Share an insight, caveat, or question.
Bayati et al. (2007) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: