RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive
Fundam. Prikl. Mat., 2014 Volume 19, Issue 1, Pages 21–32 (Mi fpm1566)
This article is cited in 1 paper

An algorithm for detecting communities in social networks

M. I. Kolomeychenko, A. A. Chepovskiy, A. M. Chepovskiy

National Research University "Higher School of Economics", Moscow, Russia

Abstract: 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.

UDC: 004.421.2+519.178


 English version: Journal of Mathematical Sciences (New York), 2015, 211:3, 310–318

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024