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 …

We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …

The recent adoption of blockchain technologies and open permissionless networks suggest
the importance of peer-to-peer atomic cross-chain transaction protocols. Users should be …

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 …

A subgraph query searches for all embeddings in a data graph that are identical to a query
graph. Two kinds of algorithms, either graph exploration based or join based, have been …

Graph matching, as one of the most fundamental problems in graph database, has a wide
range of applications. Due to the large scale of graph database and the hardness of graph …

This tutorial serves as a comprehensive guide for understanding graph databases, focusing
on the fundamentals of graph theory while showcasing practical applications across various …

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 …

Graph pattern mining (GPM) is a class of algorithms widely used in many real-world
applications in bio-medicine, e-commerce, security, social sciences, etc. GPM is a …

Graph pattern mining (GPM) is a key building block in diverse applications, including
bioinformatics, chemical engineering, social network analysis, recommender systems and …