Enhancing Maximum Common Subgraph Problem Dynamics

New heuristics improve MCS problem through Maximum Clique and Independent Set reformulation.