Cohesive Subgraph Computation over Large Sparse Graphs
Algorithms, Data Structures, and Programming Techniques
1st Edition
Published on 24. December 2018
XII, 107 pages
978-3-030-03599-0 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Product notice
Reflowable
Illustrations
XII, 107 p. 21 illus., 1 illus. in color.
File size
2,21 MB
ISBN-13
978-3-030-03599-0 (9783030035990)
DOI
10.1007/978-3-030-03599-0
Schweitzer Classification
Other editions
Additional editions
Lijun Chang | Lu Qin
Cohesive Subgraph Computation over Large Sparse Graphs
Algorithms, Data Structures, and Programming Techniques
Book
01/2019
Springer
€53.49
Shipment within 7-9 days
Content
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.
