Efficient temporal core maintenance of massive graphs

[Free GPT-4]
[PDF] vldb.org

Local algorithms for distance-generalized core decomposition over large dynamic graphs

Q Liu, X Zhu, X Huang, J Xu - Proceedings of the VLDB Endowment, 2021 - dl.acm.org
The distance-generalized core, also called (k, h)-core, is defined as the maximal subgraph
in which every vertex has at least k vertices at distance no longer than h. Compared with k …
Enregistrer Citer Cité 23 fois Autres articles Les 6 versionsFree GPT-4
[Free GPT-4]
[PDF] arxiv.org

Scalable time-range k-core query on temporal graphs (full version)

J Yang, M Zhong, Y Zhu, T Qian, M Liu… - ar** cohesive subgraphs with minimum degree
J Kim, S Lim, J Kim - Information Sciences, 2022 - Elsevier
Cohesive subgraph discovery in a network is one of the fundamental problems and
investigated for several decades. In this paper, we propose the Overlap** Cohesive …
Enregistrer Citer Cité 5 fois Autres articles Les 6 versionsFree GPT-4

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 …
Enregistrer Citer Cité 5 fois Autres articles Les 3 versionsFree GPT-4

Generalized core maintenance of dynamic bipartite graphs

W Bai, Y Chen, D Wu, Z Huang, Y Zhou… - Data Mining and …, 2022 - Springer
Abstract k-core is important in many graph mining applications, such as community detection
and clique finding. As one generalized concept of k-core,(i, j)-core is more suited for bipartite …
Enregistrer Citer Cité 7 fois Autres articles Les 6 versionsFree GPT-4