About this book
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.
Cohesive Subgraph Computation K-Core Densest Subgraph K-Edge Connected Component Maximum Clique
- DOI https://doi.org/10.1007/978-3-030-03599-0
- Copyright Information Springer Nature Switzerland AG 2018
- Publisher Name Springer, Cham
- eBook Packages Mathematics and Statistics Mathematics and Statistics (R0)
- Print ISBN 978-3-030-03598-3
- Online ISBN 978-3-030-03599-0
- Series Print ISSN 2365-5674
- Series Online ISSN 2365-5682
- Buy this book on publisher's site