title   
  

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

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
1847Kb

Official URL: https://hal.inria.fr/hal-01743802/

Abstract

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.

Item Type:Working Paper / Technical Report
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:35221
Deposited By:Kamer Kaya
Deposited On:31 Jul 2018 16:42
Last Modified:31 Jul 2018 16:42

Repository Staff Only: item control page