A survey of community search over big graphs

Y Fang, X Huang, L Qin, Y Zhang, W Zhang, R Cheng… - The VLDB Journal, 2020 - Springer
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 …

k-core: Theories and applications

YX Kong, GY Shi, RJ Wu, YC Zhang - Physics Reports, 2019 - Elsevier
With the rapid development of science and technology, the world is becoming increasingly
connected. The following dire need for understanding both the relationships amongst …

The core decomposition of networks: Theory, algorithms and applications

FD Malliaros, C Giatsidis, AN Papadopoulos… - The VLDB Journal, 2020 - Springer
The core decomposition of networks has attracted significant attention due to its numerous
applications in real-life problems. Simply stated, the core decomposition of a network …

[PDF][PDF] Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks.

K Wang, X Lin, L Qin, W Zhang, Y Zhang - PVLDB, 2019 - opus.lib.uts.edu.au
Bipartite networks are of great importance in many realworld applications. In bipartite
networks, butterfly (ie, a complete 2× 2 biclique) is the smallest non-trivial cohesive structure …

Maximum co-located community search in large scale social networks

L Chen, C Liu, R Zhou, J Li, X Yang… - Proceedings of the VLDB …, 2018 - dl.acm.org
The problem of k-truss search has been well defined and investigated to find the highly
correlated user groups in social networks. But there is no previous study to consider the …

VAC: vertex-centric attributed community search

Q Liu, Y Zhu, M Zhao, X Huang, J Xu… - 2020 IEEE 36th …, 2020 - ieeexplore.ieee.org
Attributed community search aims to find the community with strong structure and attribute
cohesiveness from attributed graphs. However, existing works suffer from two major …

Efficient computing of radius-bounded k-cores

K Wang, X Cao, X Lin, W Zhang… - 2018 IEEE 34th …, 2018 - ieeexplore.ieee.org
Driven by real-life applications in geo-social networks, in this paper, we investigate the
problem of computing the radius-bounded k-cores (RB-k-cores) that aims to find cohesive …

Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs

L Dhulipala, QC Liu, S Raskhodnikova… - 2022 IEEE 63rd …, 2022 - ieeexplore.ieee.org
Differentially private algorithms allow large-scale data analytics while preserving user
privacy. Designing such algorithms for graph data is gaining importance with the growth of …

Multiplex network community detection algorithm based on motif awareness

C Li, X Guo, W Lin, Z Tang, J Cao, Y Zhang - Knowledge-Based Systems, 2023 - Elsevier
Multiplex networks have shown high utility in modeling complex systems, eg, academic
social networks. Composite community structures contribute to revealing meaningful …

Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions

Y Fang, K Wang, X Lin, W Zhang - Proceedings of the 2021 International …, 2021 - dl.acm.org
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 …