%0 Journal Article %1 laplante2015polynomial %A LaPlante, Michael %D 2015 %K Complexity Computational %T A Polynomial Time Algorithm For Solving Clique Problems %U http://arxiv.org/abs/1503.04794 %X 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.

@article{laplante2015polynomial, 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.}, added-at = {2015-07-07T12:54:22.000+0200}, author = {LaPlante, Michael}, biburl = {https://www.bibsonomy.org/bibtex/26c4e9897a43c870b6bd69611b283ed50/yasamanyek}, description = {A Polynomial Time Algorithm For Solving Clique Problems}, interhash = {692385685c60bfb008e84a07ab6dbec4}, intrahash = {6c4e9897a43c870b6bd69611b283ed50}, keywords = {Complexity Computational}, note = {cite arxiv:1503.04794Comment: 23 pages, 35 figures and some blocks of pseudo-code, but the algorithm is explained by page 7 and 11 figures}, timestamp = {2015-07-07T12:54:22.000+0200}, title = {A Polynomial Time Algorithm For Solving Clique Problems}, url = {http://arxiv.org/abs/1503.04794}, year = 2015 }