The growing availability of multirelational data gives rise to an opportunity for novel
characterization of complex real-world relations, supporting the proliferation of diverse …

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 …

Assistive product (AP) aims to provide supplementary treatment for patients' physical
function and daily activities to improve their functional status. One challenge in the AP …

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

Centrality measures have been widely used to capture the properties of different nodes in a
social network, particularly when the edges are fully deterministic. Various models have also …

Advanced biological technologies are producing large-scale protein-protein interaction (PPI)
data at an ever increasing pace, which enable us to identify protein complexes from PPI …

Graph data are prevalent in communication networks, social media, and biological networks.
These data, which are often noisy or inexact, can be represented by uncertain graphs …

Maximal clique enumeration on uncertain graphs is a fundamental problem in uncertain
graph analysis. In this paper, we study a problem of enumerating all maximal (k, n)-cliques …

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 …