cliquematch: Finding correspondence via cliques in large graphs

TL;DR

cliquematch is a Python package that efficiently finds maximum cliques in large correspondence graphs, enabling applications in computer vision, bioinformatics, and network analysis with high performance on consumer hardware.

Contribution

It introduces a framework and algorithm for large-scale maximum clique detection in correspondence graphs, with implementation in C++ for high efficiency.

Findings

Processes graphs of a few million edges on consumer hardware.

Provides performance comparable to existing methods.

Offers a simple framework for constructing correspondence 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.