|
Fundamentalnaya i Prikladnaya Matematika, 2014, Volume 19, Issue 1, Pages 21–32
(Mi fpm1566)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Citation:
M. I. Kolomeychenko, A. A. Chepovskiy, A. M. Chepovskiy, “An algorithm for detecting communities in social networks”, Fundam. Prikl. Mat., 19:1 (2014), 21–32; J. Math. Sci., 211:3 (2015), 310–318
Linking options:
https://www.mathnet.ru/eng/fpm1566 https://www.mathnet.ru/eng/fpm/v19/i1/p21
|
Statistics & downloads: |
Abstract page: | 475 | Full-text PDF : | 296 | References: | 59 |
|