LEADER 04060nam  22007575  450 
001 9910725101403321
005 20251113175016.0
010   $a9783031322969$b(electronic bk.)
010   $z9783031322952
024 7 $a10.1007/978-3-031-32296-9
035   $a(MiAaPQ)EBC30545056
035   $a(Au-PeEL)EBL30545056
035   $a(OCoLC)1379802738
035   $a(BIP)090872633
035   $a(PPN)270612173
035   $a(CKB)26707052100041
035   $a(DE-He213)978-3-031-32296-9
035   $a(EXLCZ)9926707052100041
100   $a20230427d2023      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aAlgorithms and Models for the Web Graph $e18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23?26, 2023, Proceedings /$fedited by Megan Dewar, Pawe? Pra?at, Przemys?aw Szufel, François Théberge, Ma?gorzata Wrzosek
205   $a1st ed. 2023.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023.
215   $a1 online resource (203 pages)
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13894
311 08$aPrint version: Dewar, Megan Algorithms and Models for the Web Graph Cham : Springer,c2023 9783031322952 
320   $aIncludes bibliographical references and index.
327   $aCorrecting 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x1611-3349 ;$v13894
606   $aComputer science
606   $aData structures (Computer science)
606   $aInformation theory
606   $aApplication software
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aComputer networks
606   $aTheory of Computation
606   $aData Structures and Information Theory
606   $aComputer and Information Systems Applications
606   $aDiscrete Mathematics in Computer Science
606   $aComputer Communication Networks
615  0$aComputer science.
615  0$aData structures (Computer science)
615  0$aInformation theory.
615  0$aApplication software.
615  0$aComputer science$xMathematics.
615  0$aDiscrete mathematics.
615  0$aComputer networks.
615 14$aTheory of Computation.
615 24$aData Structures and Information Theory.
615 24$aComputer and Information Systems Applications.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aComputer Communication Networks.
676   $a005.1
702   $aDewar$b Megan
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
912   $a9910725101403321
996   $aAlgorithms and Models for the Web-Graph$9772606
997   $aUNINA