Delivery included to the United States

Cohesive Subgraph Computation Over Large Sparse Graphs

Cohesive Subgraph Computation Over Large Sparse Graphs Algorithms, Data Structures, and Programming Techniques - Springer Series in the Data Sciences

Hardback (07 Jan 2019)

Save $7.71

  • RRP $61.06
  • $53.35
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

free Reserve & collect

Copies available at Blackwell's Oxford Broad Street

Reserve in Store |  Check stock elsewhere

Publisher's Synopsis

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.

Book information

ISBN: 9783030035983
Publisher: Springer International Publishing
Imprint: Springer
Pub date:
Language: English
Number of pages: 107
Weight: 354g
Height: 235mm
Width: 155mm
Spine width: 8mm