An implementation of an algorithm for finding the largest clique within an universe of vertex and edges. As far as my calculation and tests proves, this approach seam to need only polynomial time. Disproof if you can!
Primary LanguageJava
This repository is not active