An algorithm for detecting communities in social networks
Fundamentalʹnaâ i prikladnaâ matematika, Tome 19 (2014) no. 1, pp. 21-32
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper, we propose an algorithm to find subgraphs with given properties in large social networks. A computational experiment that confirms the effectiveness of the proposed algorithm is presented.
@article{FPM_2014_19_1_a2,
author = {M. I. Kolomeychenko and A. A. Chepovskiy and A. M. Chepovskiy},
title = {An algorithm for detecting communities in social networks},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {21--32},
publisher = {mathdoc},
volume = {19},
number = {1},
year = {2014},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a2/}
}
TY - JOUR AU - M. I. Kolomeychenko AU - A. A. Chepovskiy AU - A. M. Chepovskiy TI - An algorithm for detecting communities in social networks JO - Fundamentalʹnaâ i prikladnaâ matematika PY - 2014 SP - 21 EP - 32 VL - 19 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a2/ LA - ru ID - FPM_2014_19_1_a2 ER -
%0 Journal Article %A M. I. Kolomeychenko %A A. A. Chepovskiy %A A. M. Chepovskiy %T An algorithm for detecting communities in social networks %J Fundamentalʹnaâ i prikladnaâ matematika %D 2014 %P 21-32 %V 19 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a2/ %G ru %F FPM_2014_19_1_a2
M. I. Kolomeychenko; A. A. Chepovskiy; A. M. Chepovskiy. An algorithm for detecting communities in social networks. Fundamentalʹnaâ i prikladnaâ matematika, Tome 19 (2014) no. 1, pp. 21-32. http://geodesic.mathdoc.fr/item/FPM_2014_19_1_a2/