An O(m) Algorithm for Cores Decomposition of Networks
<|reference_start|>An O(m) Algorithm for Cores Decomposition of Networks: 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.<|reference_end|>
@article{batagelj2003an,
    title={An O(m) Algorithm for Cores Decomposition of Networks},
    author={V. Batagelj and M. Zaversnik},
    journal={Advances in Data Analysis and Classification, 2011. Volume 5,
  Number 2, 129-145},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0310049},
    primaryClass={cs.DS cs.DM}
}