mcqd
Algorithm to find the maximum clique in a graph

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

GPL-2.0-or-later

To download packages, you need to log in and have a valid subscription.

Please select a product to see the available package versions:

Loading package downloads...