Graph mining is an important research area with a plethora of practical applications. Core decomposition in networks, is a fundamental operation strongly related to more complex mining tasks such as community detection, dense subgraph discovery, identification of influential nodes, network visualization, text mining, just to name a few. In this tutorial, we present in detail the concept and properties of core decomposition in graphs, the associated algorithms for its efficient computation and some of its most important applications.
['Fragkiskos D. Malliaros', 'Apostolos N. Papadopoulos', 'Michalis Vazirgiannis']
Core Decomposition in Graphs: Concepts, Algorithms and Applications