Scaling matrices and counting the perfect matchings in graphs
Dufossé, Fanny and Kaya, Kamer and Panagiotas, Ioannis and Uçar, Bora (2018) Scaling matrices and counting the perfect matchings in graphs. [Working Paper / Technical Report] Sabanci University ID:9161
Official URL: https://hal.inria.fr/hal-01743802/
We investigate efficient randomized methods for approximating the number of perfect matchings in bipartite graphs and general graphs. Our approach is based on assigning probabilities to edges.
Repository Staff Only: item control page