Perform the k-core of a graph.
[go,ind] = NARVAL_G_kCore(g,k)
graph.
node degree.
output graph.
list of deleted nodes.
NARVAL_G_kCore performs the k-core go 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 d<=k (WIKIPEDIA). The list of deleted nodes is stored in ind.
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346