Is it possible to find the maximum clique in general graphs?
classification
💻 cs.DS
cs.CCcs.DM
keywords
maximumcliqueablealgorithmsapproximatebelongsboundedcases
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.