An O(m) Algorithm for Cores Decomposition of Networks

TL;DR

This paper presents an efficient linear-time algorithm for computing the k-cores decomposition of large networks, enabling better analysis and understanding of their structure.

Contribution

The paper introduces an $O(m)$ algorithm for k-cores decomposition, improving computational efficiency over previous methods.

Findings

The algorithm operates in linear time relative to the number of edges.

It facilitates faster analysis of large network structures.

The method is applicable to various large-scale network datasets.

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.