A Polynomial Time Algorithm For Solving Clique Problems
Data Structures and Algorithms
2015-03-17 v1
Abstract
I present a single algorithm which solves the clique problems, "What is the largest size clique?", "What are all the maximal cliques?" and the decision problem, "Does a clique of size k exist?" for any given graph in polynomial time. The existence of this algorithm proves that P = NP.
Cite
@article{arxiv.1503.04794,
title = {A Polynomial Time Algorithm For Solving Clique Problems},
author = {Michael LaPlante},
journal= {arXiv preprint arXiv:1503.04794},
year = {2015}
}
Comments
23 pages, 35 figures and some blocks of pseudo-code, but the algorithm is explained by page 7 and 11 figures