Cliquer

Routines for clique searching

Project website

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 Östergård. It is designed with the aim of being efficient while still being flexible and easy to use.

channel:

unstable

version:

1.23

supported:

Yes

broken:

No

license:

Free

platforms:

44