You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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!