On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
DOI10.1016/J.DAM.2009.01.011zbMATH Open1231.05193OpenAlexW2011807187MaRDI QIDQ5901067FDOQ5901067
Authors: L. Alcón, Luerbio Faria, Celina M. H. de Figueiredo, M. Gutierrez 
Publication date: 13 August 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://sedici.unlp.edu.ar/handle/10915/82445
Recommendations
approximation algorithmsclique graphsNP-completeclique-Helly graphsMax SNP-hardhereditary clique-Helly graphs
Extremal problems in graph theory (05C35) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Topics in Intersection Graph Theory
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Graph Classes: A Survey
- The node-deletion problem for hereditary properties is NP-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The approximation of maximum subgraph problems
- Clique Graph Recognition Is NP-Complete
Cited In (3)
This page was built for publication: On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901067)
