Author:
Huang Jinbin,Huang Xin,Zhu Yuanyuan,Xu Jianliang
Funder
Natural Science Foundation of Hubei Province
National Natural Science Foundation of China
Research Grants Council, University Grants Committee
University Grants Committee
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference54 articles.
1. Aridhi, S., Brugnara, M., Montresor, A., Velegrakis, Y.: Distributed k-core decomposition and maintenance in large dynamic graphs. In: DEBS, pp 161–168. ACM (2016)
2. Arifuzzaman, S., Khan, M., Marathe, M.: Fast parallel algorithms for counting and listing triangles in big graphs. TKDD 14(1), 1–34 (2019)
3. Batagelj, V., Zaversnik, M.: An o (m) algorithm for cores decomposition of networks arXiv preprint cs/0310049 (2003)
4. Bonchi, F, Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. In: KDD, pp 1316–1325. ACM (2014)
5. Chang, L., Qin, L.: Cohesive subgraph computation over large sparse graphs: algorithms, data structures, and programming techniques. Springer, Berlin (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献