Publisher
Springer International Publishing
Reference40 articles.
1. Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269–287 (1983)
2. Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. In: The Computing Research Repository (CoRR).
arXiv:cs.DS/0310049
(2003)
3. Batagelj, V., Zaveršnik, M.: Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal. Classif. 5(2), 129–145 (2011)
4. Cheng, J., Ke, Y., Chu, S., Özsu, M.T.: Efficient core decomposition in massive networks. In: 27th International Conference on Data Engineering (ICDE), pp. 51–62. IEEE, Hannover (2011)
5. Garas, A., Schweitzer, F., Havlin, S.: A k-shell decomposition method for weighted networks. New J. Phys. 14(8), 083030 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel Order-Based Core Maintenance in Dynamic Graphs;Proceedings of the 52nd International Conference on Parallel Processing;2023-08-07