Cohesive Subgraph Computation over Large Sparse Graphs Algorithms, Data Structures, and Programming Techniques /

• Κύριοι συγγραφείς: Chang, Lijun (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut), Qin, Lu (http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: Springer Series in the Data Sciences,
• Θέματα: Algorithms.; Data structures (Computer science).; Data Structures.

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 realizi...

Πίνακας περιεχομένων:

• 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.