With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

Recently, the topic of community search (CS) has gained plenty of attention. Given a query
vertex, CS looks for a dense subgraph that contains it. Existing studies mainly focus on …

Recently, community search over graphs has attracted significant attention and many
algorithms have been developed for finding dense subgraphs from large graphs that contain …

Communities are prevalent in social networks, knowledge graphs, and biological networks.
Recently, the topic of community search (CS) has received plenty of attention. Given a query …

We consider the community search problem defined upon a large graph G: given a query
vertex q in G, to find as output all the densely connected subgraphs of G, each of which …

Bipartite graphs are widely used to model relation-ships between two types of entities.
Community search retrieves densely connected subgraphs containing a query vertex, which …

Community search is important in graph analysis and can be used in many real applications.
In the literature, various community models have been proposed. However, most of them …

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 …

Community search enables personalized community discovery and has wide applications in
large real-world graphs. While community search has been extensively studied for …

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