A Polynomial Time Solution to the Clique Problem
Data Structures and Algorithms
2020-01-01 v2 Optimization and Control
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.
Cite
@article{arxiv.1403.1178,
title = {A Polynomial Time Solution to the Clique Problem},
author = {Pawan Tamta and B. P. Pande and H. S. Dhami},
journal= {arXiv preprint arXiv:1403.1178},
year = {2020}
}
Comments
There is an error while applying the algorithm to the large size problems. This algorithm doesn't provide solution to all Clique problems es, 2 figures