Core decomposition has proven to be a useful primitive for a wide range of graph analyses.
One of its most appealing features is that, unlike other notions of dense subgraphs, it can be …

A key operation in network analysis is the discovery of cohesive subgraphs. The notion of k-
truss has gained considerable popularity in this regard, based on its rich structure and …

Data collected nowadays by social-networking applications create fascinating opportunities
for building novel services, as well as expanding our understanding about social structures …

The availability of massive vehicle trajectory data enables the modeling of road-network
constrained movement as travel-cost distributions rather than just single-valued costs …

In this paper, we investigate the highly reliable subgraph problem, which arises in the
context of uncertain graphs. This problem attempts to identify all induced subgraphs for …

As uncertainty is inherent in a wide spectrum of graph applications such as social network
and brain network, it is highly demanded to re-visit classical graph problems in the context of …

Many studies have been conducted on seeking the efficient solution for subgraph similarity
search over certain (deterministic) graphs due to its wide application in many fields …

A reachability oracle (or hop labeling) assigns each vertex v two sets of vertices: Lout (v) and
Lin (v), such that u reaches v iff Lout (u)\cap Lin (v)\neq\emptyset. Despite their simplicity and …

Many graphs in practical applications are not deterministic, but are probabilistic in nature
because the existence of the edges is inferred with the use of a variety of statistical …

Social influence has attracted significant attention owing to the prevalence of social
networks (SNs). In this paper, we study a new social influence problem, called personalized …