{c}

= M. Zaveršnik
{c}
{synonym}

<Matjaž Zaveršnik> is a <mathematician> whose work with <Vladimir Batagelj> includes an efficient algorithm for finding all <k-cores> of networks. Their paper presents a method whose running time is linear in the number of edges for the networks considered, making the decomposition practical on large inputs.https://arxiv.org/abs/cs/0310049[An O(m) Algorithm for Cores Decomposition of Networks, authors and abstract]{ref} The key structural object is a <k-core>: a maximal <induced subgraph> whose minimum degree is at least $k$. Assigning each vertex its largest such $k$ provides a compact description of its position within nested connected regions; a high value records local connectivity rather than merely a large original degree.

<Mathematician>.

Biographical record: https://www2.arnes.si/~sspmgiac/mirk2003/Zbornik.pdf


 Matjaž Zaveršnik (source code)