Sciweavers

Share
EDBT
2016
ACM

Core Decomposition in Graphs: Concepts, Algorithms and Applications

3 years 23 days ago
Core Decomposition in Graphs: Concepts, Algorithms and Applications
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
Added 02 Apr 2016
Updated 02 Apr 2016
Type Journal
Year 2016
Where EDBT
Authors Fragkiskos D. Malliaros, Apostolos N. Papadopoulos, Michalis Vazirgiannis
Comments (0)
books