Cohesive Subgraph Computation over Large Sparse Graphs

Algorithms, Data Structures, and Programming Techniques de

,

Éditeur :

Springer


Collection :

Springer Series in the Data Sciences

Paru le : 2018-12-24

eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
52,74

Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

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.


Pages
107 pages
Collection
Springer Series in the Data Sciences
Parution
2018-12-24
Marque
Springer
EAN papier
9783030035983
EAN PDF
9783030035990

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
10
Taille du fichier
2212 Ko
Prix
52,74 €
EAN EPUB
9783030035990

Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
10
Taille du fichier
7270 Ko
Prix
52,74 €