The Maximum Common Subgraph (MCS) is a complex theoretical computer science problem. It is a generalization of the Subgraph Isomorphism challenge and it finds numerous applications in chemistry, biology, medicine, and network management. This research focuses on improving the performance of the McSplit algorithm, a popular recursive Branch-and-Bound ground-truth MCS solver. The work aims to develop a tool that efficiently identifies the largest subgraph of a graph pair within a given time limit, addressing real-world scenarios, whereas finding the optimal solution is not necessarily the primary goal. A diverse range of strategies has been explored to identify the most effective approaches for future advancements, leading to the development of multiple prototype solvers belonging to three families.