Subgraph Isomorphism is a fundamental problem in graph data processing. Most existing
subgraph isomorphism algorithms are based on a backtracking framework which computes …

Finding subgraph isomorphisms is an important problem in many applications which deal
with data modeled as graphs. While this problem is NP-hard, in recent years, many …

Graph data management systems have become very popular as graphs are the natural data
model for many applications. One of the main problems addressed by these systems is …

Existing work on subgraph isomorphism search mainly focuses on a-query-at-a-time
approaches: optimizing and answering each query separately. When multiple queries arrive …

A subgraph query finds all data graphs in a graph database each of which contains the
given query graph. Existing work takes the indexing-filtering-verification (IFV) approach to …

Given a query graph q and a data graph g, the subgraph isomorphism search finds all
occurrences of q in g and is considered one of the most fundamental query types for many …

Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …

Subgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph
analysis. Extensive research has been done to develop practical solutions for subgraph …

Subgraph query processing (also known as subgraph search) and subgraph matching are
fundamental graph problems in many application domains. A lot of efforts have been made …

Queries to detect isomorphic subgraphs are important in graph-based data management.
While the problem of subgraph isomorphism search has received considerable attention for …