Is there any algorithm to calculate the largest common subgraph from 3 or more directed graphs?

Question

I know how to calculate the largest common subgraph from 2 graphs, there are many algorithms, currently I\'m using VF2 algorithm, but when the graph number increases to 3 or 4 o