Algorithms and Models for the Web Graph 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

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

20%

Preț: 1040^.03 lei
20%

Preț: 333^.46 lei
20%

Preț: 335^.08 lei
20%

Preț: 444^.17 lei
20%

Preț: 238^.01 lei
20%

Preț: 333^.46 lei
20%

Preț: 438^.69 lei
Preț: 440^.52 lei
20%

Preț: 336^.71 lei
20%

Preț: 148^.66 lei
20%

Preț: 310^.26 lei
20%

Preț: 256^.27 lei
20%

Preț: 632^.22 lei
17%

Preț: 427^.22 lei
20%

Preț: 641^.78 lei
20%

Preț: 307^.71 lei
20%

Preț: 1053^.45 lei
20%

Preț: 579^.56 lei
Preț: 373^.56 lei
20%

Preț: 330^.23 lei
15%

Preț: 429^.74 lei
20%

Preț: 607^.39 lei
20%

Preț: 538^.29 lei
Preț: 389^.48 lei
20%

Preț: 326^.98 lei
20%

Preț: 1386^.07 lei
20%

Preț: 1003^.66 lei
20%

Preț: 567^.60 lei
20%

Preț: 575^.48 lei
20%

Preț: 571^.63 lei
20%

Preț: 747^.79 lei
15%

Preț: 568^.74 lei
17%

Preț: 360^.19 lei
20%

Preț: 504^.57 lei
20%

Preț: 172^.69 lei
20%

Preț: 369^.12 lei
20%

Preț: 346^.40 lei
20%

Preț: 574^.05 lei
Preț: 402^.62 lei
20%

Preț: 584^.40 lei
20%

Preț: 747^.79 lei
20%

Preț: 809^.19 lei
20%

Preț: 649^.49 lei
20%

Preț: 343^.16 lei
20%

Preț: 309^.90 lei
20%

Preț: 122^.89 lei

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.