Combinatorics and Graph Theory


The Clique Problem - A Polynomial Time and Non-Heuristic Solution

Authors: John Archie Gillis

The Clique Problem This paper provides a Polynomial Time and Non-Heuristic Solution to the Clique problem. Methods are given to find: 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. 4.Finding cliques of a selected size, particularly largest cliques.

Comments: 53 Pages.

Download: PDF

Submission history

[v1] 2018-09-09 10:39:33

Unique-IP document downloads: 86 times 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. 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