Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …

Attributed community search aims to find the community with strong structure and attribute
cohesiveness from attributed graphs. However, existing works suffer from two major …

The studies of k-truss based community search demonstrated that it can find high-quality
personalized com-munities with good properties such as high connectivity and bounded …

With the advent of a wide spectrum of recent applications, querying heterogeneous
information networks (HINs) has received a great deal of attention from both academic and …

The problem of community search, which aims to find a cohesive subgraph containing user-
given query vertices, has been extensively studied recently. Most of the existing studies …

Community search over large dynamic graph has become an important research problem in
modern complex networks, such as the online social network, collaboration network and …

Community search (CS) enables personalized community discovery and has found a wide
spectrum of emerging applications such as setting up social events and friend …

Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …

Searching for local communities is an important research challenge that allows for
personalized community discovery and supports advanced data analysis in various complex …

Community search aims at finding densely connected subgraphs for query vertices in a
graph. While this task has been studied widely in the literature, most of the existing works …