株式会社極東書店トップ > 商品一覧 > Cohesive Subgraph Computation over Large Sparse Graphs: Algorithms, Data Structures, and Programming Techniques. 2018 ed.
商品詳細
Cohesive Subgraph Computation over Large Sparse Graphs: Algorithms, Data Structures, and Programming Techniques. 2018 ed.
・ISBN 978-3-030-03598-3 hard EUR 49.99
¥13,361.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Chang, Lijun / Qin, Lu, |
|---|---|
| シリーズ | (Springer Series in the Data Sciences) |
| 出版社 | (Springer Nature Switzerland AG, SZ) |
| 出版年月 | 2019 |
| ページ数 | 107 pp. |
| 言語 | ENG |
| ニュース番号 | <A02-59350> |
解説
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.