Constructing the highest degree subgraph for dense graphs is in NCAS

Author： Andreev A.E.   Clementi A.E.F.   Rolim J.D.P.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.161, Iss.1, 1996-07, pp. : 307-314

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

Related content

Frequent subgraph mining in outerplanar graphs

By Horváth Tamás  

Data Mining and Knowledge Discovery, Vol. 21, Iss. 3, 2010-11 ,pp. : 472-508

Springer Publishing Company

Access to resources Recommend Favorite

The parallel complexity of approximating the high degree subgraph problem

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

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

Elsevier

Access to resources Recommend Favorite

Dense subgraph maintenance under streaming edge weight updates for real-time story identification

By Angel Albert   Koudas Nick   Sarkas Nikos   Srivastava Divesh   Svendsen Michael   Tirthapura Srikanta  

The VLDB Journal, Vol. 23, Iss. 2, 2014-04 ,pp. : 175-199

Springer Publishing Company

Access to resources Recommend Favorite

On the Benefits of Adaptivity in Property Testing of Dense Graphs

By Gonen Mira   Ron Dana  

Algorithmica, Vol. 58, Iss. 4, 2010-12 ,pp. : 811-830

Springer Publishing Company

Access to resources Recommend Favorite

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. : 281-290

Elsevier

Access to resources Recommend Favorite