-
Notifications
You must be signed in to change notification settings - Fork 0
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!
Macilias/maxclique
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
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!
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published