Has anyone implemented an algorithm to find the the number of nodes in a k-core graph using the algorithm mentioned on wikipedia below? If yes, then does the algorithm scales well for 10,s of thousands of nodes?
https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)