Inductive Graph Algorithm

In graph theory, a K-degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most K: that is, some vertex in the subgraph touches K or fewer of the subgraph's edges. The connected components that are leave after all vertices of degree less than K have been removed are named the K-cores of the graph and the degeneracy of a graph is the largest value K such that it has a K-core.

Inductive Graph source code, pseudocode and analysis