@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 “},
  author = {Batagelj, Vladimir and Zaveršnik, Matjaž},
  doi = {10.1007/s11634-010-0079-y},
  interhash = {a0bd7331f81bb4da72ce115d5943d6e4},
  intrahash = {cd0d5266688af6bb98bde7f99e3a54c1},
  issn = {1862-5347},
  journal = {Advances in Data Analysis and Classification},
  language = {English},
  number = 2,
  pages = {129--145},
  publisher = {Springer},
  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
}