%0 Generic %1 Batagelj2003Om %A Batagelj, V. %A Zaversnik, M. %D 2003 %K networks algorithms k-core %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.

@electronic{Batagelj2003Om, 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 = {2019-06-10T14:53:09.000+0200}, archiveprefix = {arXiv}, author = {Batagelj, V. and Zaversnik, M.}, biburl = {https://www.bibsonomy.org/bibtex/20483790e0c3a8618f23629e75df9bbb1/nonancourt}, citeulike-article-id = {2829576}, citeulike-linkout-0 = {http://arxiv.org/abs/cs/0310049}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs/0310049}, day = 25, eprint = {cs/0310049}, interhash = {63be428635128d4eebd095e2ca44cdf2}, intrahash = {0483790e0c3a8618f23629e75df9bbb1}, keywords = {networks algorithms k-core}, month = oct, posted-at = {2009-05-28 15:47:42}, priority = {2}, timestamp = {2019-08-01T16:09:09.000+0200}, title = {{An O(m) Algorithm for Cores Decomposition of Networks}}, url = {http://arxiv.org/abs/cs/0310049}, year = 2003 }