Polyhedral study of the maximum common induced subgraph problem

In this paper we present an exact algorithm for the Maximum Common Induced Subgraph Problem (MCIS) by addressing it directly, using Integer Programming (IP) and polyhedral combinatorics. We study the MCIS polytope and introduce strong valid inequalities, some of which we prove to define facets. Besides, we show an equivalence between our IP model for MCIS and a well‐known formulation for the Maximum Clique problem. We report on computational results of branch‐and‐bound (B&B) and branch‐and‐cut (B&C) algorithms we implemented and compare them to those yielded by an existing combinatorial algorithm.