My Account Log in

1 option

Algorithms and Models for the Web Graph : 18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23–26, 2023, Proceedings / edited by Megan Dewar, Paweł Prałat, Przemysław Szufel, François Théberge, Małgorzata Wrzosek.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Dewar, Megan, editor.
Series:
Lecture Notes in Computer Science, 1611-3349 ; 13894
Language:
English
Subjects (All):
Computer science.
Data structures (Computer science).
Information theory.
Application software.
Computer science--Mathematics.
Discrete mathematics.
Computer networks.
Theory of Computation.
Data Structures and Information Theory.
Computer and Information Systems Applications.
Discrete Mathematics in Computer Science.
Computer Communication Networks.
Local Subjects:
Theory of Computation.
Data Structures and Information Theory.
Computer and Information Systems Applications.
Discrete Mathematics in Computer Science.
Computer Communication Networks.
Physical Description:
1 online resource (203 pages)
Edition:
1st ed. 2023.
Place of Publication:
Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Summary:
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.
Contents:
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.
Notes:
Includes bibliographical references and index.
Other Format:
Print version: Dewar, Megan Algorithms and Models for the Web Graph
ISBN:
9783031322969
OCLC:
1379802738

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account