The k-core of a graph is defined as the maximal subgraph in which every vertex is
connected to at least k other vertices within that subgraph. In this work we introduce a …

Local community detection refers to finding the community that contains the given node
based on local information, which becomes very meaningful when global information about …

Community search that finds only the communities pertaining to the query input has been
widely studied from simple graphs to attributed graphs. However, a significant limitation of …

Community detection is of significant importance in understanding the structures and
functions of networks. Recently, overlapping community detection has drawn much attention …

Uncertainty in graph data occurs for a variety of reasons, such as noise and measurement
errors. Recently, uncertain graph management and analysis have attracted many research …

Detecting local graph clusters is an important problem in big graph analysis. Given seed
nodes in a graph, local clustering aims at finding subgraphs around the seed nodes, which …

In social network analysis, structural cohesion (or vertex connectivity) is a fundamental
metric in measuring the cohesion of social groups. Given an undirected graph, a k-vertex …

The group nearest neighbor (GNN) search on a road network Gr, ie, finding the spatial
objects as activity assembly points with the smallest sum of distances to query users on Gr …

Finding community structures in social networks is considered to be a challenging task as
many of the proposed algorithms are computationally expensive and does not scale well for …

Community search is an important problem in network analysis, which has attracted much
attention in recent years. It starts with some given nodes, pays more attention to local …