2019/03/26 by R. Dharmarajan, Dharmarajan, R., D. Ramachandran +1
Computer Science · Mathematics · #05C69 #Advanced Optimization Algorithms Research #Algebraic and Geometric Analysis #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Matrix Theory and Algorithms
paper · pdf · doi:10.48550/arxiv.1903.10700
openalex publication_date 2019/03/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.