![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Bayati Mohsen Kim Jeong Saberi Amin
Publisher: Springer Publishing Company
ISSN: 0178-4617
Source: Algorithmica, Vol.58, Iss.4, 2010-12, pp. : 860-910
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Small maximal matchings in random graphs
By Zito M.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Non-uniform random spanning trees on weighted graphs
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :