## Introduction

GMMC is a generalized method for geometric graph matching. It uses descriptors to calculate compatibilities between curves and a search algorithm inspired on the Monte Carlo tree search to group compatible curves to obtain a match between graphs.

It is implemented in C++ with a wrapper on MATLAB using mex. It uses the Eigen library for matrix operations.