%0 Generic %1 batagelj2003algorithm %A Batagelj, V. %A Zaversnik, M. %D 2003 %K core graph network %T An O(m) Algorithm for Cores Decomposition of Networks %U http://arxiv.org/abs/cs/0310049 %X 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.

@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.}, added-at = {2012-10-04T16:18:47.000+0200}, author = {Batagelj, V. and Zaversnik, M.}, biburl = {https://www.bibsonomy.org/bibtex/2d533733cd010732a5ca81417f4deca0a/sdo}, description = {[cs/0310049] An O(m) Algorithm for Cores Decomposition of Networks}, interhash = {63be428635128d4eebd095e2ca44cdf2}, intrahash = {d533733cd010732a5ca81417f4deca0a}, keywords = {core graph network}, note = {cite arxiv:cs/0310049}, timestamp = {2012-10-04T16:18:47.000+0200}, title = {An O(m) Algorithm for Cores Decomposition of Networks}, url = {http://arxiv.org/abs/cs/0310049}, year = 2003 }