Nettleton, David F.; Dries, Anton
(Foundation of Computer Science, 2015)
Approximate sub-graph matching is important in many graph data mining fields. At present, current solutions can be difficult to implement, have an expensive pre-processing phase, or only work for given types of graph. In ...