Subgraphs are obtained by extracting a subset of vertices and a subset of edges from the
associated original graphs, and many graph properties are known to be inherited by …

Supergraph search is a fundamental graph query processing problem. Supergraph search
aims to find all data graphs contained in a given query graph based on the subgraph …

Subgraph counting, as a fundamental problem in network analysis, is to count the number of
subgraphs in a data graph that match a given query graph by either homomorphism or …

Graph edit distance (GED) computation is a fundamental NP-hard problem in graph theory.
Given a graph pair (G 1, G 2), GED is defined as the minimum number of primitive …

Community search has been extensively studied in the past decades. In recent years, there
is a growing interest in attributed community search that aims to identify a community based …

Map matching of sparse vehicle trajectories is a fundamental problem in location-based
services, such as traffic flow analysis and vehicle routing. Existing literature mainly relies on …

Subgraph counting is a fundamental component for many downstream applications such as
graph representation learning and query optimization. Since obtaining the exact count is …

We study local subgraph counting queries, Q=(p, o), to count how many times a given k-
node pattern graph p appears around every node υ in a data graph G when the given center …

This paper studies the problem of fair clustering on heterogeneous information networks
(HINs) by considering constraints on structural and sensitive attributes. We propose a …

Attributed community search (ACS) aims to identify subgraphs satisfying both structure
cohesiveness and attribute homogeneity in attributed graphs, for a given query that contains …