Complexity results on graphs with few cliques

Abstract : A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection representation that satisfies the Helly property. On any such class of graphs, some problems that are NP-complete on general graphs, such as the maximum clique problem and the maximum weighted clique problem, admit polynomial time algorithms. Other problems, such as the vertex clique cover and edge clique cover problems remain NP-complete on these classes. Several classes of graphs which have few cliques are discussed, and the complexity of some partitioning and covering problems are determined for the class of all graphs which have fewer cliques than a given polynomial bound.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (1), pp.127--135
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00966509
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 26 mars 2014 - 16:59:27
Dernière modification le : samedi 18 novembre 2017 - 01:06:28
Document(s) archivé(s) le : jeudi 26 juin 2014 - 11:56:30

Fichier

dm090108.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00966509, version 1

Collections

Citation

Bill Rosgen, Lorna Stewart. Complexity results on graphs with few cliques. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (1), pp.127--135. 〈hal-00966509〉

Partager

Métriques

Consultations de la notice

221

Téléchargements de fichiers

261