cliquematch: Finding correspondence via cliques in large graphs

Abstract

The maximum clique problem finds applications in computer vision, bioinformatics, and network analysis, many of which involve the construction of correspondence graphs to find similarities between two given objects. cliquematch is a Python package designed for this purpose: it provides a simple framework to construct correspondence graphs, and implements an algorithm to find and enumerate maximum cliques in C++, that can process graphs of a few million edges on consumer hardware, with comparable performance to publicly available methods.

11 pages, 3 figures, 1 table; Code available at https://github.com/ahgamut/cliquematch