Finding correspondence via maximum cliques in large graphs¶
cliquematch package aims to do two specific things:
Construct large sparse undirected graphs in-memory for the various applications of the maximum clique/clique enumeration problem.
cliquematch does not provide a way to modify a large graph once
it has been loaded, or any other general capability, because: (1) the internal
data structures are designed to optimize the clique search, (2) sparse graphs
constructed for applications of the maximum clique problem are rarely modified
by hand (constructed anew instead), and (3) there are better
igraph) for general graph analysis.
- User Guide
- API Documentation