|
| Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt. |
Cohesive Subgraph Computation over Large Sparse Graphs
Algorithms, Data Structures, and Programming Techniques
Sofort lieferbar | Lieferzeit: Sofort lieferbar I
ISBN-13:
9783030035990
Veröffentl:
2018
Seiten:
107
Autor:
Lijun Chang
Serie:
Springer Series in the Data Sciences
eBook Typ:
PDF
eBook Format:
EPUB
Kopierschutz:
1 - PDF Watermark
Sprache:
Englisch
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.
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.
Kunden Rezensionen
Mehr zum Thema
Folgen Sie uns auf:
