On the random generation and counting of matchings in dense graphs

DOI10.1016/S0304-3975(97)00297-1zbMath0902.68142OpenAlexW2045196370MaRDI QIDQ1129018

Paul G. Spirakis, Maria J. Serna, Josep Diaz

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00297-1

zbMATH Keywords

Markov chainsmatchingsrandom generationapproximate counting

Mathematics Subject Classification ID

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

Related Items (2)

A Glimpse at Paul G. Spirakis ⋮ Some upper bounds for permanents of (0, 1)-matrices

Cites Work

• Fast uniform generation of regular graphs
• Random generation of combinatorial structures from a uniform distribution
• Matching is as easy as matrix inversion
• Monte-Carlo approximation algorithms for enumeration problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the random generation and counting of matchings in dense graphs