Distributed processing of large-scale graph data has many practical applications and has
been widely studied. In recent years, a lot of distributed graph processing frameworks and …

Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it
impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed …

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 …

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 …

GraphScope is a system and a set of language extensions that enable a new programming
interface for large-scale distributed graph computing. It generalizes previous graph …

Subgraph enumeration is a fundamental problem in graph analytics, which aims to find all
instances of a given query graph on a large data graph. In this paper, we propose a system …

A bipartite network is a network with two disjoint vertex sets and its edges only exist between
vertices from different sets. It has received much interest since it can be used to model the …

In this paper, we study the problem of label-constrained reachability (LCR) query which is
fundamental in many applications with directed edge-label graphs. Although the classical …

Hop-constrained st simple path (HC-st path) enumeration is a fundamental problem in graph
analysis and has received considerable attention recently. Straightforward distributed …

Subgraph matching is a basic operation widely used in many applications. However, due to
its NP-hardness and the explosive growth of graph data, it is challenging to compute …