@misc{batagelj2003algorithm,
abstract = {The structure of large networks can be revealed by partitioning them to
smaller parts, which are easier to handle. One of such decompositions is based
on $k$--cores, proposed in 1983 by Seidman. In the paper an efficient, $O(m)$,
$m$ is the number of lines, algorithm for determining the cores decomposition
of a given network is presented.},
author = {Batagelj, V. and Zaversnik, M.},
interhash = {63be428635128d4eebd095e2ca44cdf2},
intrahash = {d533733cd010732a5ca81417f4deca0a},
note = {cite arxiv:cs/0310049},
title = {An O(m) Algorithm for Cores Decomposition of Networks},
url = {http://arxiv.org/abs/cs/0310049},
year = 2003
}