Maximum clique in an undirected graph
This package computes MaxCliqueDyn, a fast exact algorithm for finding a maximum clique in an undirected graph.
Release | Stable | Testing |
---|---|---|
Fedora 40 | 1.0.0-12.20160901.9ab9717.fc40 | - |
You can contact the maintainers of this package via email at
mcqd dash maintainers at fedoraproject dot org
.