LEADER 04022nam  22007935  450 
001 9910855366303321
005 20251113175132.0
010   $a9783031592058
010   $a3031592050
024 7 $a10.1007/978-3-031-59205-8
035   $a(CKB)31801763500041
035   $a(MiAaPQ)EBC31310591
035   $a(Au-PeEL)EBL31310591
035   $a(MiAaPQ)EBC31319746
035   $a(Au-PeEL)EBL31319746
035   $a(DE-He213)978-3-031-59205-8
035   $a(OCoLC)1433023954
035   $a(EXLCZ)9931801763500041
100   $a20240429d2024      u|         0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aModelling and Mining Networks $e19th International Workshop, WAW 2024, Warsaw, Poland, June 3?6, 2024, Proceedings /$fedited by Megan Dewar, Bogumi? Kami?ski, Daniel Kaszy?ski, ?ukasz Krai?ski, Pawe? Pra?at, François Théberge, Ma?gorzata Wrzosek
205   $a1st ed. 2024.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024.
215   $a1 online resource (194 pages)
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14671
311 08$a9783031592041 
311 08$a3031592042 
327   $a -- Subgraph Counts in Random Clustering Graphs -- Self similarity of Communities of the ABCD Model -- A simple model of influence Details and variants of dynamics -- Impact of Market Design and Trading Network Structure on Market Efficiency -- Network Embedding Exploration Tool (NEExT) -- Efficient Computation of k Edge Connected Components: An Empirical Analysis -- The directed Age dependent Random Connection Model with arc reciprocity -- How to cool a graph -- Distributed averaging for accuracy prediction in networked systems -- Towards Graph Clustering for Distributed Computing Environments -- Hypergraph Repository A Community driven and Interactive Hypernetwork Data Collection -- Clique Counts for Network Similarity.
330   $aThis book constitutes the refereed proceedings of the 19th International Workshop on Modelling and Mining Networks, WAW 2024, held in Warsaw, Poland, during June 3?6, 2024. The 12 full papers presented in this book were carefully reviewed and selected from 19 submissions. The aim of this workshop was to further the understanding of networks that arise in theoretical as well as applied domains. The goal was also to stimulate the development of high-performance and scalable algorithms that exploit these networks. .
410  0$aLecture Notes in Computer Science,$x1611-3349 ;$v14671
606   $aComputer science
606   $aData structures (Computer science)
606   $aInformation theory
606   $aApplication software
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aTheory of Computation
606   $aData Structures and Information Theory
606   $aComputer and Information Systems Applications
606   $aDiscrete Mathematics in Computer Science
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 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.
676   $a004.0151
700   $aDewar$b Megan$01737394
701   $aKamin?ski$b Bogumi?$00
701   $aKaszyn?ski$b Daniel$00
701   $aKrai?ski$b ?ukasz$01737397
701   $aPra?at$b Pawe?$01737398
701   $aThe?berge$b Franc?ois$00
701   $aWrzosek$b Ma?gorzata$01737400
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910855366303321
996   $aModelling and Mining Networks$94159137
997   $aUNINA