= Vladimir Batagelj
{c}
{wiki}
= V. Batagelj
{c}
{synonym}
<Vladimir Batagelj> is a <mathematician> whose work includes <graph algorithms> and the analysis of large networks. With <Matjaž Zaveršnik>, he developed an efficient algorithm for finding all <k-cores> of a network, a way to reveal nested regions of increasing internal connectivity.https://arxiv.org/abs/cs/0310049[An O(m) Algorithm for Cores Decomposition of Networks, authors and abstract]{ref} A <k-core> is a maximal <induced subgraph> in which every vertex has degree at least $k$. Repeatedly removing vertices of insufficient degree exposes this structure. The decomposition helps distinguish densely connected parts of a network from peripheral vertices without requiring an exhaustive search through all vertex subsets.
<Mathematician>.
Biographical record: https://www2.arnes.si/~sspmgiac/mirk2003/Zbornik.pdf
\Image[https://commons.wikimedia.org/wiki/Special:Redirect/file/Batagelj_Vladimir.jpg?width=250]
{title=Portrait of <Vladimir Batagelj>}
{description=Andrej Bauer. https://creativecommons.org/licenses/by-sa/2.5/[CC BY-SA 2.5], via Wikimedia Commons.}
{source=https://commons.wikimedia.org/wiki/File:Batagelj_Vladimir.jpg}
{width=250}
Back to article page
