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

José Ignacio Alvarez-Hamelin (1, 2)

1 INTECIN - Instituto de Tecnologías y Ciencias de la Ingeniería "Hilario Fernández Long" [Buenos Aires]
2 Laboratorio de Teleinformática [Buenos Aires]

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: complexity; graphs; algorithms

Domaines: Mathématique discrète [cs.DM]

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