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 …
used in graph mining applications such as community detection, visualization, and clique …
Batch dynamic algorithm to find k-core hierarchies
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 …
otherwise sparse graphs. We focus on the important problem of maintaining cores on rapidly …
Public-private-core maintenance in public-private-graphs
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 …
relationships, and it consists of one public graph in which edges are visible to all users, and …