cliquematch

Finding correspondence via maximum cliques in large graphs

The cliquematch package aims to do two specific things:

1. Find a maximum clique in large sparse undirected graphs, as quickly and efficiently as possible. (cliquematch uses C++ internally to implement a really fast maximum clique algorithm).

2. Construct large sparse undirected graphs in-memory for the various applications of the maximum clique problem.

That’s it. 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 packages (networkx and igraph) for general graph analysis.

Note

cliquematch version 2 is available: it has a simpler API, and also implements clique enumeration. View version 2 at the master branch or docs.

Contents:

• Installing cliquematch
  • Installing from a wheel
  • Installing from source
• User Guide
  • Finding a Maximum Clique
  • Applications of the maximum clique problem
• API Documentation
• How cliquematch works
  • Benchmarking the cliquematch algorithm
  • Correspondence Graphs in C++