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 …

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

Graphs are widely used to model the intricate relationships among objects in a wide range
of applications. The advance in graph data has brought significant value to artificial …

Hop-constrained st simple path (HC-st path) enumeration is a fundamental problem in graph
analysis. Existing solutions for this problem focus on unlabelled graphs and assume queries …

Abstract Structural Graph Clustering (SCAN) is a fundamental problem in graph analysis
and has received considerable attention recently. Existing distributed solutions either lack …

Core decomposition is one of the most fundamental problems in graph analytics, which is
associated with numerous applications, such as community detection, protein network …

There are many real-world application domains where data can be naturally modelled as a
graph, such as social networks and computer networks. Relational Database Management …

Graph analysis plays a crucial role in understanding the relationships and structures within
complex systems. This thesis focuses on addressing fundamental problems in graph …

Field-programmable gate arrays (FPGAs) have significant advantages in parallelism and
energy efficiency over CPUs and GPUs and are widely deployed by many enterprises and …

In graph data applications, data is primarily maintained using two models: RDF (Resource
Description Framework) and property graph. The property graph model is widely adopted by …