Cohesive Subgraph Computation over Large Sparse Graphs

Algorithms, Data Structures, and Programming Techniques
Springer (Verlag)
  • erschienen am 7. Januar 2019
  • Buch
  • |
  • Hardcover
  • |
  • XII, 107 Seiten
978-3-030-03598-3 (ISBN)
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.
  • Englisch
  • Cham
  • |
  • Schweiz
Springer International Publishing
  • Für Beruf und Forschung
  • 20 s/w Abbildungen, 1 farbige Abbildung, 1 farbige Tabelle
  • |
  • 19 schwarz-weiße und 2 farbige Abbildungen, 1 farbige Tabellen, Bibliographie
  • Höhe: 243 mm
  • |
  • Breite: 161 mm
  • |
  • Dicke: 15 mm
  • 337 gr
978-3-030-03598-3 (9783030035983)
weitere Ausgaben werden ermittelt
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.
DNB DDC Sachgruppen

Versand in 5-7 Tagen

58,84 €
inkl. 7% MwSt.
Sonderpreis bis 30.06.2020
Aktion Yellow Sale | statt 90,94 €
in den Warenkorb