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.[ref]
https://arxiv.org/abs/cs/0310049. An O(m) Algorithm for Cores Decomposition of Networks, authors and abstract
A k-core is a maximal induced subgraph in which every vertex has degree at least . 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.Biographical record: www2.arnes.si/~sspmgiac/mirk2003/Zbornik.pdf
Portrait of Vladimir Batagelj
. Andrej Bauer. CC BY-SA 2.5, via Wikimedia Commons. Source. Articles by others on the same topic
Vladimir Batagelj is a noted Slovenian statistician and mathematician, particularly recognized for his work in the fields of graph theory and network analysis. He has contributed to the development of various mathematical methods and techniques, and he is also known for his involvement in software development for social network analysis. Batagelj is associated with the University of Ljubljana and has published numerous research papers in his areas of expertise.