Author： Zito M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.297, Iss.1, 2003-03, pp. : 487-507
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
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. :
Access to resources
Recommend
By Bhatnagar Nayantara Randall Dana Vazirani Vijay Vigoda Eric
Algorithmica, Vol. 50, Iss. 4, 2008-04 ,pp. :
Dynamic Load Balancing by Random Matchings
Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. :
A simple recognition of maximal planar graphs
By Nagamochi H. Suzuki T. Ishii T.
Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. :
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. :