Maximal clique enumeration is a fundamental problem in graph theory and has been
extensively studied. However, maximal clique enumeration is time-consuming in large …

Influence maximization (IM), which selects a set of $ k $ users (called seeds) to maximize the
influence spread over a social network, is a fundamental problem in a wide range of …

This study considers a class of critical node detection problems that involves minimization of
a distance‐based connectivity measure of a given unweighted graph via the removal of a …

The distance-based critical node problem involves identifying a subset of nodes in a graph
such that the removal of these nodes leads to a residual graph with the minimum distance …

Many graphs in real-world applications, such as telecommunications networks, social-
interaction graphs and co-authorship graphs, contain temporal information. However …

We study the classic NP-Hard problem of finding the maximum k-set coverage in the data
stream model: given a set system of m sets that are subsets of a universe 1,…, n {1,...,n\}, find …

Subgraph querying in a large data graph is interesting for different applications. A recent
study shows that top-k diversified results are useful since the number of matching subgraphs …

Mining dense subgraphs on multi-layer graphs is an interesting problem, which has
witnessed lots of applications in practice. To overcome the limitations of the quasi-clique …

Driven by real-life applications in geo-social networks, we study the problem of computing
radius-bounded-cores (RB--cores) that aims to find communities satisfying both social and …

We study the classic set cover problem in the streaming model: the sets that comprise the
instance are revealed one by one in a stream and the goal is to solve the problem by making …