Abstract: Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for ...

This is a preview. Log in through your library . Abstract Sierpiński graphs $S_p^n$ form an extensively studied family of graphs of fractal nature applicable in ...