A Novel Approach Applied to the Largest Clique Problem
<|reference_start|>A Novel Approach Applied to the Largest Clique Problem: 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$.<|reference_end|>
@article{gudkov2002a,
    title={A Novel Approach Applied to the Largest Clique Problem},
    author={Vladimir Gudkov, Shmuel Nussinov and Zohar Nussinov},
    journal={arXiv preprint arXiv:cond-mat/0209419},
    year={2002},
    archivePrefix={arXiv},
    eprint={cond-mat/0209419},
    primaryClass={cond-mat cs.DM math.CO physics.comp-ph}
}