Kcore Decomposition
Definition
The kcore of graph is a maximal subgraph in which each vertex has at least degree k. The coreness of a vertex is k if it belongs to the kcore but not to the (k+1)core.
Kshell decomposition to directed networks
V. Batagelj, M. Zaversnik, Generalized cores, 2002, arXiv:cs.DS/0202039.
Kshell decomposition to weighted networks
A. Garas, F. Schweitzer, S. Havlin, A kshell decomposition method for weighted networks, New J. Phys. 14 (2012) 083030.
Kshell decomposition to directed networks
V. Batagelj, M. Zaversnik, Generalized cores, 2002, arXiv:cs.DS/0202039.
Kshell decomposition to weighted networks
A. Garas, F. Schweitzer, S. Havlin, A kshell decomposition method for weighted networks, New J. Phys. 14 (2012) 083030.
References
 BATAGELJ, V. & ZAVERSNIK, M. 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049.
 CSARDI, G. & NEPUSZ, T. 2006. The igraph software package for complex network research. InterJournal, Complex Systems, 1695. [http://igraph.org]
 SEIDMAN, S. B. 1983. Network structure and minimum degree. Social Networks, 5, 269287. DOI: 10.1016/03788733(83)90028X
Comments
Hi, Is there any package in R or Python, that would allow we to conduct core decomposition based on strength (weighted network) of the nodes? 

Add Replay  written July 19, 2019, 2:54 pm by Drahomir 
Hi, Is there any package in R or Python, that would allow we to conduct core decomposition based on strength (weighted network) of the nodes? 

Add Replay  written July 19, 2019, 2:54 pm by Drahomir 