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

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.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00625917
Author Alvarez-Hamelin, José Ignacio
Maintainer CCSD
Last Updated May 27, 2026, 23:37 (UTC)
Created May 27, 2026, 23:37 (UTC)
Identifier hal-00625917
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Instituto de Tecnologías y Ciencias de la Ingeniería "Hilario Fernández Long" [Buenos Aires] (INTECIN) ; Facultad de Ingeniería [Buenos Aires] (FIUBA) ; Universidad de Buenos Aires [Buenos Aires] (UBA)-Universidad de Buenos Aires [Buenos Aires] (UBA)-Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires] (CONICET)
creator Alvarez-Hamelin, José Ignacio
date 2011-09-16T00:00:00
harvest_object_id bb773421-bf61-497d-b180-8a034128a3c4
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-01-08T00:00:00
set_spec type:UNDEFINED