Cohesive Subgraph Computation over Large Sparse Graphs

Includes data structures that can be of general use for efficient graph processing Considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation Source code of highly optimized algorithms is provided

Contenu
Introduction.- Linear Heap Data Structures.- Minimum Degree-based Core Decomposition.- Average Degree-based Densest Subgraph Computation.- Higher-order Structure-based Graph Decomposition.- Edge Connectivity-based Graph Decomposition.