The problem of subgraph matching is one fundamental issue in graph search, which is NP-
Complete problem. Recently, subgraph matching has become a popular research topic in …

Subgraph matching is a fundamental problem in graph analysis. In recent years, many
subgraph matching algorithms have been proposed, making it pressing and challenging to …

Abstract Knowledge graph has wide applications in the field of computer science. In the
knowledge service environment, the information is large and explosive, and it is difficult to …

Graph pattern matching is widely used in real-world applications, such as social network
analysis. Since the traditional subgraph isomorphism is NP-complete and often too …

Abstract Nowadays, Resource Description Framework (RDF) query has been widely used in
social networks, biomedicine and other fields. With the explosion of RDF data due to the …

An important combinatorial problem is subgraph isomorphism, which formalizes the task of
searching for occurrences of a known substructure within a larger structure represented by a …

Subgraph matching is one fundamental issue in the research area of graph analysis, which
has a wild range of applications, including question answering, semantic search and …

A dynamic graph is defined by an initial graph and a graph update stream consisting of edge
insertions and deletions. Given a query graph and a dynamic data graph, the problem of …