A Novel Approach Applied to the Largest Clique Problem
classification
❄️ cond-mat
cs.DMmath.COphysics.comp-ph
keywords
graphproblemappliedapproachcliquelargestnovelapply
read the original abstract
A novel approach to complex problems has been previously applied to graph classification and the graph equivalence problem. Here we apply it to the NP complete problem of finding the largest perfect clique within a graph $G$.
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.