  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.
