Modelling and Mining Networks [electronic resource] : 19th International Workshop, WAW 2024, Warsaw, Poland, June 3-6, 2024, Proceedings / edited by Megan Dewar, Bogumił Kamiński, Daniel Kaszyński, Łukasz Kraiński, Paweł Prałat, François Théberge, Małgorzata Wrzosek.

Colaborador(es): Dewar, Megan [editor.] | Kamiński, Bogumił [editor.] | Kaszyński, Daniel [editor.] | Kraiński, Łukasz [editor.] | Prałat, Paweł [editor.] | Théberge, François [editor.] | Wrzosek, Małgorzata [editor.] | SpringerLink (Online service)Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 14671Editor: Cham : Springer Nature Switzerland : Imprint: Springer, 2024Edición: 1st ed. 2024Descripción: X, 185 p. 41 illus., 31 illus. in color. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783031592058Tema(s): Computer science | Data structures (Computer science) | Information theory | Application software | Computer science -- Mathematics | Discrete mathematics | Theory of Computation | Data Structures and Information Theory | Computer and Information Systems Applications | Discrete Mathematics in Computer ScienceFormatos físicos adicionales: Printed edition:: Sin título; Printed edition:: Sin títuloClasificación CDD: 004.0151 Clasificación LoC:QA75.5-76.95Recursos en línea: Libro electrónicoTexto
Contenidos:
-- 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.
En: Springer Nature eBookResumen: This 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. .
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos 1 No para préstamo

-- 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.

This 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. .

UABC ; Perpetuidad

Con tecnología Koha