Title of article :
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs Original Research Article
Author/Authors :
L. Alc?n، نويسنده , , L. Faria، نويسنده , , C.M.H. de Figueiredo، نويسنده , , M. Gutierrez، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Abstract :
Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition is NP-complete, in: Proc. WG 2006, in: Lecture Notes in Comput. Sci., vol. 4271, Springer, 2006, pp. 269–27
Keywords :
Hereditary clique-Helly graphs , Max SNP-hard , Clique-Helly graphs , Approximation algorithms , Clique graphs , NP-complete
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
