Dyer, Martin; Jerrum, Mark; Müller, Haiko On the switch Markov chain for perfect matchings. (English) Zbl 1426.60097 J. ACM 64, No. 2, Article No. 12, 33 p. (2017). Cited in 13 Documents MSC: 60J10 Markov chains (discrete-time Markov processes on discrete state spaces) 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 68W20 Randomized algorithms Keywords:counting problems; bipartite graphs; hereditary graph classes; perfect matching; permanent Citations:Zbl 1373.62176 PDFBibTeX XMLCite \textit{M. Dyer} et al., J. ACM 64, No. 2, Article No. 12, 33 p. (2017; Zbl 1426.60097) Full Text: DOI Link