Set Theory and Logic

    

The Clique Problem with Collaborative Variables (P=NP)

Authors: John Archie Gillis

The present paper provides a novel approach to solving the clique problem(s). The present methods will work for any clique problem, including those which are determined to be NP-Complete. Determining other cliques, such as cliques of a fixed size (k=3, k=4, etc.) is trivial by comparison but will also be described. The author provides a means for greatly reducing the time that it will take a computer (or human) to solve for: 1. Maximum clique (a clique with the largest possible number of vertices), 2. Listing all maximal cliques (cliques that cannot be enlarged), and 3. Solving the decision problem of testing whether a graph contains a clique larger than a given size. To solve the clique problem, the author feels that we must completely discard previous graphing methods and start from scratch with his new and novel strategy.

Comments: 15 Pages.

Download: PDF

Submission history

[v1] 2020-09-30 19:27:22

Unique-IP document downloads: 736 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus