Maximum common induced subgraph

[4] Moreover, a modified maximum-clique algorithm can be used to find a maximum common connected subgraph.

Both versions of the McSplit algorithm outperform the clique encoding for many graph classes.

[6] A more efficient implementation of McSplit is McSplitDAL+PR, which combines a Reinforcement Learning agent with some heuristic scores computed with the PageRank algorithm.

Maximum common induced subgraph algorithms have a long tradition in bioinformatics, cheminformatics,[8][9] pharmacophore mapping,[10] pattern recognition,[11] computer vision, code analysis, compilers, and model checking.

Graph differencing can be used to detect changes between different versions of software code and models for change auditing, debugging, version control and collaborative team development.