Library to find cliques in arbitrary weighted graphs
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.
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 1.23-1.fc43 | - |
| Fedora 43 | 1.23-1.fc43 | - |
| Fedora 42 | 1.23-1.fc42 | - |
| Fedora 41 | 1.22-9.fc41 | - |
You can contact the maintainers of this package via email at
cliquer dash maintainers at fedoraproject dot org.