A comparison of ILP formulations for solving the MCES problem

The Maximum Common Edge Subgraph Problem (MCES), given two graphs G and H, asks about finding a maximum common subgraph between those two graphs with a maximal number of edges. We present new integer linear programming formulations for MCES and compare the performances of those formulations with earlier formulations from the literature.