blob: 421b623dcc63c6a68ac65c84bd504a33c8e694a2 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
|
Cliquer is a set of C routines for finding cliques in an arbitrary weighted
graph. It uses an exact branch-and-bound algorithm developed by Patric
Ostergard. It is designed with the aim of being efficient while still being
flexible and easy to use.
Note: this port do not use the upstream version, but the version autotoolized
by Dima Pasechnik.
See also: https://github.com/dimpase/autocliquer
|