Cohesive Subgraph Computation over Large Sparse Graphs

Algorithms, Data Structures, and Programming Techniques

Lijun Chang, Lu Qin (Autoren)

Buch | Hardcover

XII, 107 Seiten

2019 | 1st ed. 2018
Springer International Publishing (Verlag)
978-3-030-03598-3 (ISBN)

Artikel merken

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.

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.

Erscheinungsdatum	09.01.2019
Reihe/Serie	Springer Series in the Data Sciences
Zusatzinfo	XII, 107 p. 21 illus., 1 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	337 g
Themenwelt	Mathematik / Informatik ► Informatik ► Datenbanken
	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Analysis
	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Cohesive Subgraph Computation • data structures • Densest Subgraph • K-Core • K-Edge Connected Component • Maximum Clique
ISBN-10	3-030-03598-0 / 3030035980
ISBN-13	978-3-030-03598-3 / 9783030035983
Zustand	Neuware