Algorithms for finding a non-overlapping set of cliques in a graph represented by an adjacency matrix.
-
Notifications
You must be signed in to change notification settings - Fork 1
Algorithms for finding a non-overlapping set of cliques in a graph
License
invenia/Cliquing.jl
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithms for finding a non-overlapping set of cliques in a graph
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published