Pré-Publication, Document De Travail Année : 2011

Is it possible to find the maximum clique in general graphs?

Résumé

Finding the maximum clique is a known NP-Complete problem and it is also hard to approximate. This work proposes two efficient algorithms to obtain it. Nevertheless, the first one is able to fins the maximum for some special cases, while the second one has its execution time bounded by the number of cliques that each vertex belongs to.

Mots clés

Fichier principal
Vignette du fichier
max_clique_v4.pdf (305.3 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00625917 , version 1 (08-10-2011)
hal-00625917 , version 2 (26-10-2011)
hal-00625917 , version 3 (17-02-2012)

Licence

Identifiants

  • HAL Id : hal-00625917 , version 3

Citer

José Ignacio Alvarez-Hamelin. Is it possible to find the maximum clique in general graphs?. 2011. ⟨hal-00625917v3⟩

Collections

397 Consultations
1646 Téléchargements

Partager

  • More