An O(m) Algorithm for Cores Decomposition of Networks
Data Structures and Algorithms
2013-01-22 v1 Discrete Mathematics
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 --cores, proposed in 1983 by Seidman. In the paper an efficient, , is the number of lines, algorithm for determining the cores decomposition of a given network is presented.
Cite
@article{arxiv.cs/0310049,
title = {An O(m) Algorithm for Cores Decomposition of Networks},
author = {V. Batagelj and M. Zaversnik},
journal= {arXiv preprint arXiv:cs/0310049},
year = {2013}
}