This algorithm adds an attribute to each node that specifies the k-core = that node belongs to. The k-core a node belongs to is the last k-core it wo= uld be part of before being removed from the graph in the next k-core. To f= ind a k-core, recursively remove every node with fewer than k edges connect= ed to it.

=20A k-core is a part of a graph with strong structure. K-cores have been a= nalyzed for their properties, as indicators of the structure of the graph, = and to help visualize graphs.

=20B. Bollobas, The evolution of sparse graphs, in Graph Theory and Combina=
torics, Proc. Cambridge Combinatorial Conf. in honor of Paul Erdos, Academi=
c Press, 1984, 35-57. (References: [ALGDOC:1], [ALGDOC:2])

S. B. Seidma=
n, Network structure and minimum degree, Social Networks 5:269-287.

Siz=
e and Connectivity of the k-core of a Random Graph. ?uczak, Tomasz.

Gen=
eralized Cores. V. Batagelj, M. Zaversnik.

k-Core Organization of Compl=
ex Networks. Dorogovtsev, Goltsev, Mendes

The license could not be verified: License Certificate has expired!=20
Generate a Free license now.