2 search results - page 1 / 1 » Perfect Matchings via Uniform Sampling in Regular Bipartite ... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
FOCS
1999
IEEE
13 years 8 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...