Lijun Chang & Lu Qin 
Cohesive Subgraph Computation over Large Sparse Graphs [PDF ebook] 
Algorithms, Data Structures, and Programming Techniques

Soporte


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.

€53.49
Métodos de pago

Tabla de materias

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.

¡Compre este libro electrónico y obtenga 1 más GRATIS!
Idioma Inglés ● Formato PDF ● Páginas 107 ● ISBN 9783030035990 ● Tamaño de archivo 2.3 MB ● Editorial Springer International Publishing ● Ciudad Cham ● País CH ● Publicado 2018 ● Descargable 24 meses ● Divisa EUR ● ID 6800273 ● Protección de copia DRM social

Más ebooks del mismo autor / Editor

4.014 Ebooks en esta categoría