Abstract: Subgraph Matching is a fundamental problem in graph analysis, and is widely used in many application scenarios in biology, chemistry and social network. Given a data graph and a query graph, ...
Abstract: We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of the algorithm has been presented in a previous paper, where we ...
Seven subgraph matching algorithms: QuickSI, GraphQL, TurboISO, CFL-Match, VF3, CECI, DAF. Each algorithm also has a boosted version, which is enhanced by techniques of BoostISO.
Given a query graph Q anchored at node q, and a target graph T anchored at node v, predict if there exists an isomorphism mapping a subgraph of T to Q, such that the isomorphism maps v to q. The ...