Today's social networks continuously generate massive streams of data, which provide a
valuable starting point for the detection of rumours as soon as they start to propagate …

In this paper, we study exact hypercore maintenance in large-scale dynamic hypergraphs. A
hypergraph, whose hyperedges may contain a set of vertices rather than two vertices in …

This article studies the batch processing of truss maintenance in large graphs. Trussness is
a widely used index in graph analytics for cohesive subgraph mining. It is defined on edges …

Maximal Clique Enumeration (MCE) is a fundamental graph mining problem and is useful as
a primitive in identifying dense structures in a graph. Due to the high computational cost of …

In this paper, we study hypercore maintenance in large-scale dynamic hypergraphs. A
hypergraph, whose hyperedges may contain a set of vertices rather than two vertices in …

User engagement has recently received significant attention in understanding the decay and
expansion of communities in many online social networking platforms. When a user chooses …

We show that theoptimal'use of the parallel composition theorem corresponds to finding the
size of the largest subset of queries thatoverlap'on the data domain, a quantity we call …

The incremental problem for a class of graph queries aims to compute, given a query, graph
G, answers Q (G) to Q in G and updates ΔG to G as input, changes ΔO to output Q (G) such …

Link streams offer a good model for representing interactions over time. They consist of links
$(b, e, u, v) $, where $ u $ and $ v $ are vertices interacting during the whole time interval …

Finding dense regions of graphs is fundamental in graph mining. We focus on the
computation of dense hierarchies and regions with graph nuclei---a generalization of k …