Cliquing
Algorithms for finding a non-overlapping set of cliques in a graph represented by an adjacency matrix.
- Popularity
- 6 Stars
- Updated Last
- 1 Year Ago
- Started In
- December 2020
Algorithms for finding a non-overlapping set of cliques in a graph represented by an adjacency matrix.