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 mode...
Cuprins
Introduction.- Linear Heap Data Structures.- Minimum Degree-based Core Decomposition.- Average Degree-based Densest Subgraph Computation.- Higher-order Structure-based Graph...
Cumpărați această carte electronică și primiți încă 1 GRATUIT!
Limba Engleză ● Format PDF ● Pagini 107 ● ISBN 9783030035990 ● Mărime fișier 2.3 MB ● Editura Springer International Publishing ● Oraș Cham ● Țară CH ● Publicat 2018 ● Descărcabil 24 luni ● Valută EUR ● ID 6800273 ● Protecție împotriva copiilor DRM social