Author:
Cui Lizhen,Yue Lingxi,Wen Dong,Qin Lu
Funder
National Key R&D Program
NSFC
SDNSF
Shandong Major scientific and technological innovation projects
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Computational Mechanics
Reference34 articles.
1. Alvarez-Hamelin JI, Dall’Asta L, Barrat A, Vespignani A (2006) Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS, pp 41–50
2. Asahiro Y, Iwama K, Tamaki H, Tokuyama T (2000) Greedily finding a dense subgraph. J Algorithms 34(2):203–221
3. Batagelj V, Zaversnik M (2003) An o(m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049
4. Bonchi F, Gullo F, Kaltenbrunner A, Volkovich Y (2014) Core decomposition of uncertain graphs. In: KDD, pp 1316–1325
5. Chang L, Yu JX, Qin L, Lin X, Liu C, Liang W (2013) Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD, pp 205–216
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scalable Community Search over Large-scale Graphs based on Graph Transformer;Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval;2024-07-10
2. Finding Dense and Persistently Expansive Subgraphs;Companion Proceedings of the ACM Web Conference 2024;2024-05-13
3. Efficient Distributed Core Graph Decomposition;2023 IEEE International Conference on Data Mining Workshops (ICDMW);2023-12-04
4. Balanced Clique Computation in Signed Networks: Concepts and Algorithms;IEEE Transactions on Knowledge and Data Engineering;2022
5. Multiple Local Community Detection via High-Quality Seed Identification over Both Static and Dynamic Networks;Data Science and Engineering;2021-05-07