Cohesive Subgraph Computation over Large Sparse Graphs

Beschreibung

This book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for realizing big values of data to serve key applications, but also brings great challenges in computation. Using a consistent terminology, the book gives an excellent introduction to the models and algorithms for the problem of cohesive subgraph computation. The materials of this book are well organized from introductory content to more advanced topics while also providing well-designed source codes for most algorithms described in the book. This is a timely book for researchers who are interested in this topic and efficient data structure design for large sparse graph processing. It is also a guideline book for new researchers to get to know the area of cohesive subgraph computation.



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

Autor*in

Lijun Chang

Themen in »Cohesive Subgraph Computation over Large Sparse Graphs«

Cohesive Subgraph Computation K-Core Densest Subgraph K-Edge Connected Component Maximum Clique data structures

Stimmen zu »Cohesive Subgraph Computation over Large Sparse Graphs«

Details

Link teilen