Authors: Liu et al. Year: 2019

paper

Proposes data structures and search algorithms for retrieving the top $k$ most similar subgraphs given a query graph. The algorithm allowes for some inexact matching such as missing nodes or edges.