000 04019nam a22006615i 4500
001 978-3-031-32296-9
003 DE-He213
005 20240423124952.0
007 cr nn 008mamaa
008 230427s2023 sz | s |||| 0|eng d
020 _a9783031322969
_9978-3-031-32296-9
024 7 _a10.1007/978-3-031-32296-9
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aAlgorithms and Models for the Web Graph
_h[electronic resource] :
_b18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23–26, 2023, Proceedings /
_cedited by Megan Dewar, Paweł Prałat, Przemysław Szufel, François Théberge, Małgorzata Wrzosek.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aX, 193 p. 54 illus., 43 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13894
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aApplication software.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aComputer networks .
650 1 4 _aTheory of Computation.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aComputer and Information Systems Applications.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Communication Networks.
700 1 _aDewar, Megan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPrałat, Paweł.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSzufel, Przemysław.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aThéberge, François.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWrzosek, Małgorzata.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031322952
776 0 8 _iPrinted edition:
_z9783031322976
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13894
856 4 0 _uhttps://doi.org/10.1007/978-3-031-32296-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c172741
_d172741