A Polynomial Time Solution to the Clique Problem
classification
💻 cs.DS
math.OC
keywords
problemcliquealgorithmpolynomialreductiontimebeencomputer
read the original abstract
The Clique Problem has a reduction to the Maximum Flow Network Interdiction Problem. We review the reduction to evolve a polynomial time algorithm for the Clique Problem. A computer program in C language has been written to validate the easiness of the algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.