HackerPapers

arXiv:1503.04794cs.DS

A Polynomial Time Algorithm For Solving Clique Problems

Michael LaPlante

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
23 pages, 35 figures and some blocks of pseudo-code, but the algorithm is explained by page 7 and 11 figures
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jan 2018 to Jan 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.