In recent years, we have seen a rising usage of graph-like data structures in several fields, with a wide range of applications in real-world scenarios. Various problems known by the computer science community for a long time have come back to the surface, backed up by new ideas and algorithms to challenge their commonly high degree of complexity. The Maximum Common Subgraph problem is one of them, as it is a well-known computational problem in graph theory. The MCS of the two graphs is the largest common subgraph between them, and it has great relevance in numerous fields, ranging from computer vision to malware detection and bioinformatics.