The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “
Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 batagelj2011algorithms
%A Batagelj, Vladimir
%A Zaveršnik, Matjaž
%D 2011
%I Springer
%J Advances in Data Analysis and Classification
%K analysis core graph kcore network sna social
%N 2
%P 129--145
%R 10.1007/s11634-010-0079-y
%T Fast algorithms for determining (generalized) core groups in social networks
%U http://dx.doi.org/10.1007/s11634-010-0079-y
%V 5
%X The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “
@article{batagelj2011algorithms,
abstract = {The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “},
added-at = {2013-04-15T14:39:36.000+0200},
author = {Batagelj, Vladimir and Zaveršnik, Matjaž},
biburl = {https://www.bibsonomy.org/bibtex/2cd0d5266688af6bb98bde7f99e3a54c1/jaeschke},
doi = {10.1007/s11634-010-0079-y},
interhash = {a0bd7331f81bb4da72ce115d5943d6e4},
intrahash = {cd0d5266688af6bb98bde7f99e3a54c1},
issn = {1862-5347},
journal = {Advances in Data Analysis and Classification},
keywords = {analysis core graph kcore network sna social},
language = {English},
number = 2,
pages = {129--145},
publisher = {Springer},
timestamp = {2016-01-05T08:46:42.000+0100},
title = {Fast algorithms for determining (generalized) core groups in social networks},
url = {http://dx.doi.org/10.1007/s11634-010-0079-y},
volume = 5,
year = 2011
}