VF3-Light: A lightweight subgraph isomorphism algorithm and its experimental evaluation

摘要

In this paper we introduce VF3-Light, a simplification of VF3, a recently introduced, general-purpose sub-graph isomorphism algorithm. While VF3 has demonstrated to be very effective on several datasets, especially on very large and very dense graphs, we will show that on some classes of graphs, the full power of VF3 may become an overkill; indeed, by removing some of the heuristics used in it, and as a consequence also some of the data structures that are required by them, we obtain an algorithm (VF3-Light) that is actually faster.In order to provide a characterization of this modified algorithm, we have performed an evaluation using several publicly available graph datasets. Besides comparing VF3-Light with VF3, we have also included in the comparison other recent algorithms that are rated among the fastest in the state of the art. (C) 2019 Elsevier B.V. All rights reserved.