Author： Flajolet P. Hatzis K. Nikoletseas S. Spirakis P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.287, Iss.2, 2002-09, pp. : 515-534
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Small maximal matchings in random graphs
By Zito M.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
Access to resources
Recommend
A Sequential Algorithm for Generating Random Graphs
By Bayati Mohsen Kim Jeong Saberi Amin
Algorithmica, Vol. 58, Iss. 4, 2010-12 ,pp. :
On the random generation and counting of matchings in dense graphs
By Diaz J. Serna M. Spirakis P.
Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. :
Non-uniform random spanning trees on weighted graphs
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :