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 …
Local graph clustering methods aim to find a cluster of nodes by exploring a small region of the graph. These methods are attractive because they enable targeted clustering around a …
F Ye, C Chen, Z Zheng - Proceedings of the 27th ACM international …, 2018 - dl.acm.org
Community structure is ubiquitous in real-world complex networks. The task of community detection over these networks is of paramount importance in a variety of applications …
Given a graph G and a vertex q∈ G, the community search query returns a subgraph of G that contains vertices related to q. Communities, which are prevalent in attributed graphs …
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 …
RH Li, L Qin, JX Yu, R Mao - Proceedings of the VLDB Endowment, 2015 - dl.acm.org
Community search is a problem of finding densely connected subgraphs that satisfy the query conditions in a network, which has attracted much attention in recent years. However …
E Akbas, P Zhao - Proceedings of the VLDB Endowment, 2017 - dl.acm.org
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 …