Exact sampling from perfect matchings of dense regular bipartite graphs

DOI10.1007/s00453-005-1175-9zbMath1092.68077arXivmath/0310059OpenAlexW2169943664MaRDI QIDQ2492639

Mark L. Huber

Publication date: 14 June 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0310059

zbMATH Keywords

Markov chain

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (5)

An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs ⋮ Solution Counting Algorithms for Constraint-Centered Search Heuristics ⋮ A Bernoulli mean estimate with known relative error distribution ⋮ Solution counting algorithms for constraint-centered search heuristics ⋮ Yard crane scheduling for container storage, retrieval, and relocation

This page was built for publication: Exact sampling from perfect matchings of dense regular bipartite graphs