The parallel complexity of approximating the high degree subgraph problem

Author: Andreev A.E.   Clementi A.   Crescenzi P.   Dahlhaus E.   De Agostino S.   Rolim J.D.P.  

Publisher: Elsevier

ISSN: 0304-3975

Source: Theoretical Computer Science, Vol.205, Iss.1, 1998-08, pp. : 261-282

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract