A fast algorithm for estimating the maximum k-core number in random graphs with given expected degree sequences

Chaos Solitons & Fractals 2026

View at publisher

Authors: Yang-Ming Hu, Gui-Yuan Shi, Huimin Bai, Yi-Xiu Kong, Yi‐Cheng Zhang, Rui-Jie Wu

DOI: 10.1016/j.chaos.2026.118203

Cited by: 0

References: 26

Fields of Study & Subjects

Complex Network Analysis Techniques Graph Theory and Algorithms Graph theory and applications

References 26