On the tractability of the maximum clique problem
Data Structures and Algorithms
2019-05-20 v2
Abstract
The maximum clique problem is a classical NP-complete problem in graph theory and has important applications in many domains. In this paper we show, in a partially non-constructive way, the existence of an exact polynomial-time algorithm for this problem. We outline the algorithm in pseudo-code style. Then we prove its exactness and efficiency by analysis.
Cite
@article{arxiv.1903.10700,
title = {On the tractability of the maximum clique problem},
author = {R. Dharmarajan and D. Ramachandran},
journal= {arXiv preprint arXiv:1903.10700},
year = {2019}
}
Comments
15 (fifteen) pages