Random Bichromatic Matchings

Algorithmica, pp. 418-445, 2008.

Cited by: 3|Views5
EI

Abstract:

Given a graph with edges colored Red and Blue, we study the problem of sampling and approximately counting the number of matchings with exactly kRed edges. We solve the problem of estimating the number of perfect matchings with exactly kRed edges for dense graphs. We study a Markov chain on the space of all matchings of a graph that favor...More

Code:

Data:

ZH
Your rating :
0

 

Tags
Comments