Parallel core maintenance of dynamic graphs

W Bai, Y Jiang, Y Tang, Y Li - IEEE Transactions on Knowledge …, 2022 - ieeexplore.ieee.org
A-core is the special cohesive subgraph where each vertex has at least degree. It is widely
used in graph mining applications such as community detection, visualization, and clique …

Batch dynamic algorithm to find k-core hierarchies

K Gabert, A Pinar, ÜV Çatalyürek - Proceedings of the 5th ACM SIGMOD …, 2022 - dl.acm.org
Finding k-cores in graphs is a valuable and effective strategy for extracting dense regions of
otherwise sparse graphs. We focus on the important problem of maintaining cores on rapidly …

Public-private-core maintenance in public-private-graphs

D Yu, X Zhang, Q Luo, L Zhang, Z **e… - Intelligent and …, 2021 - ieeexplore.ieee.org
A public-private-graph (pp-graph) is developed to model social networks with hidden
relationships, and it consists of one public graph in which edges are visible to all users, and …

[CITATION][C] Batch Dynamic Algorithm to Find 𝑘-Cores and Hierarchies