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 an efficient algorithm to obtain it. If the presented theorem holds, this algorithm runs in polynomial time in terms of the size of the graph.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)