Author： Gonen Mira Ron Dana
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.58, Iss.4, 2010-12, pp. : 811-830
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
Property Testing on
Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. :
Access to resources
Recommend
Constructing the highest degree subgraph for dense graphs is in NCAS
By Andreev A.E. Clementi A.E.F. Rolim J.D.P.
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,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. :
Quantum Property Testing of Group Solvability
By Inui Yoshifumi Gall François
Algorithmica, Vol. 59, Iss. 1, 2011-01 ,pp. :
Specification‐based testing using cause‐effect graphs
Annals of Software Engineering, Vol. 4, Iss. 1, 1997-01 ,pp. :