Perform the coreness vector of a graph.
[kc]=NARVAL_G_Coreness(g)
graph.
coreness vector.
NARVAL_G_Coreness performs the coreness vector kc of the graph g. The k-core of a graph is the subgraph obtained from the original graph after the removal of all nodes of degree less than or equal to k. The node coreness K of a given node is the maximum k such that this node is still present in the k-core, but removed in the k+1-core.