e/K-core

Information
has gloss	eng: K-cores in graph theory were introduced by Seidman in 1983 and by Bollobas in 1984 as a method of (destructively) simplifying graph topology to aid in analysis and visualization. They have been more recently defined as the following by Batagelj et al.: given a graph G=\V,E\} with vertices set V and edges set E, the k-core is computed by recursively pruning all the vertices (with their respective edges) with degrees less than k. That means that if a vertex u has degree d_u, and it has n neighbors with degree less than k, then u's degree becomes d_u-n, and it will be also pruned if k > d_u-n.
lexicalization	eng: k-core
instance of	c/Graph theory objects