mcqd

MaxCliqueDyn is a fast exact algorithm for finding a maximum clique in an undirected graph.

homepage: https://gitlab.com/janezkonc/mcqd

version	toolchain
1.0.0	GCC/13.2.0

(quick links: (all) - 0 - a - b - c - d - e - f - g - h - i - j - k - l - m - n - o - p - q - r - s - t - u - v - w - x - y - z)