The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

Cliquer - routines for clique searching

Cliquer is a set of C routines for finding cliques in an arbitrary weighted graph. It uses an exact branch-and-bound algorithm recently developed by Patric Östergård. It is designed with the aim of being efficient while still being flexible and easy to use.
  • Download Files (local site)
  • Offical Site

    Problem Links

    Clique (10)

    This page last modified on 2008-07-10 .