максимальная клика в графе

[незваный гость]

Рекурсия помнит, где мы остановились добавляя/удаляя.

[maxal]

Могу порекомендовать QUALEX-MS: QUick ALmost EXact maximum weight clique/independent set solver is based now on a generalization of Motzkin-Straus quadratic programming formulation. [...] The complexity of the QUALEX-MS algorithm is O(n^3) (where n is the number of vertices). An enumerative test evidences that QUALEX-MS is always exact up to 10-vertex graphs inclusive at least.