Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Models for the Web Graph: 18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23–26, 2023, Proceedings de Megan Dewar

Algorithms and Models for the Web Graph: 18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23–26, 2023, Proceedings: Lecture Notes in Computer Science, cartea 13894

Editat de Megan Dewar, Paweł Prałat, Przemysław Szufel, François Théberge, Małgorzata Wrzosek
en Limba Engleză Paperback – 28 apr 2023
This book constitutes the proceedings of the 18th International Workshop on Algorithms and Models for the Web Graph, WAW 2023, held in Toronto, Canada, in May 23–26, 2023.
The 12 Papers presented in this volume were carefully reviewed and selected from 21 submissions. The aim of the workshop was understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34607 lei

Preț vechi: 43259 lei
-20% Nou

Puncte Express: 519
Preț estimativ în valută:
6624€ • 6904$ • 5514£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031322952
ISBN-10: 3031322959
Pagini: 193
Ilustrații: X, 193 p. 54 illus., 43 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.29 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Correcting for Granularity Bias in Modularity-Based Community Detection Methods.- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects.- Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs.- Modularity Based Community Detection in Hypergraphs.- Establishing Herd Immunity is Hard Even in Simple Geometric Networks.- Multilayer hypergraph clustering using the aggregate similarity matrix.- The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis.- A Random Graph Model for Clustering Graphs.- Topological Analysis of Temporal Hypergraphs.- PageRank Nibble on the sparse directed stochastic block model.- A simple model of influence.- The Iterated Local Transitivity Model for Tournaments.