1. Vladimir Batagelj and Matjaz Zaversnik . 2003. An O(m) Algorithm for Cores Decomposition of Networks . CoRR cs.DS/0310049 ( 2003 ). http://arxiv.org/abs/cs/0310049 Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR cs.DS/0310049 (2003). http://arxiv.org/abs/cs/0310049
2. Two Simplified Algorithms for Maintaining Order in a List
3. Kate Burleson-Lesser , Flaviano Morone , Maria S Tomassone , and Hernán A Makse . 2020. k-core robustness in ecological and financial networks. Scientific reports 10, 1 ( 2020 ), 1–14. Kate Burleson-Lesser, Flaviano Morone, Maria S Tomassone, and Hernán A Makse. 2020. k-core robustness in ecological and financial networks. Scientific reports 10, 1 (2020), 1–14.
4. Efficient core decomposition in massive networks
5. Thomas H Cormen , Charles E Leiserson , Ronald L Rivest , and Clifford Stein . 2022. Introduction to algorithms . MIT press . Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2022. Introduction to algorithms. MIT press.