An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching

by   Zite Jiang, et al.
Institute of Computing Technology, Chinese Academy of Sciences
Wuhan University

Subgraph matching is a NP-complete problem that extracts isomorphic embeddings of a query graph q in a data graph G. In this paper, we present a framework with three components: Preprocessing, Reordering and Enumeration. While pruning is the core technique for almost all existing subgraph matching solvers, it mainly eliminates unnecessary enumeration over data graph without alternation of query graph. By formulating a problem: Assignment under Conditional Candidate Set(ACCS), which is proven to be equivalent to Subgraph matching problem, we propose Dynamic Graph Editing(DGE) that is for the first time designed to tailor the query graph to achieve pruning effect and performance acceleration. As a result, we proposed DGEE(Dynamic Graph Editing Enumeration), a novel enumeration algorithm combines Dynamic Graph Editing and Failing Set optimization. Our second contribution is proposing fGQL , an optimized version of GQL algorithm, that is utilized during the Preprocessing phase. Extensive experimental results show that the DGEE-based framework can outperform state-of-the-art subgraph matching algorithms.


Neural Subgraph Matching

Subgraph matching is the problem of determining the presence and locatio...

Towards Accurate Subgraph Similarity Computation via Neural Graph Pruning

Subgraph similarity search, one of the core problems in graph search, co...

Fast Subgraph Matching by Exploiting Search Failures

Subgraph matching is a compute-intensive problem that asks to enumerate ...

GuP: Fast Subgraph Matching by Guard-based Pruning

Subgraph matching, which finds subgraphs isomorphic to a query, is the k...

Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching

Subgraph matching is a fundamental problem in various fields that use gr...

A Survey and Experimental Analysis of Distributed Subgraph Matching

Recently there emerge many distributed algorithms that aim at solving su...

Exact and heuristic algorithms for Cograph Editing

We present a dynamic programming algorithm for optimally solving the Cog...

Please sign up or login with your details

Forgot password? Click here to reset