Tutorial 4

15 Dec 2016
Room A1

Tutorial 4

Core Decomposition of Networks: concepts, algorithms and applications

Fragkiskos D. Malliaros, University of California, San Diego
Apostolos N. Papadopoulos, Aristotle University of Thessaloniki, Greece
Michalis Vazirgiannis, Ecole Polytechnique, France

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 basic concepts and properties related to core decomposition in graphs, the associated algorithms for its efficient computation and some of the most important applications that benefit from it.

More info

ICDM 2016