Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Models for the Web Graph: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings de Anthony Bonato

Algorithms and Models for the Web Graph: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings: Lecture Notes in Computer Science, cartea 8305

Editat de Anthony Bonato, Michael Mitzenmacher, Pawel Pralat
en Limba Engleză Paperback – 11 noi 2013
This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph, WAW 2013, held in Cambridge, MA, USA, in December 2013. The 17 papers presented were carefully reviewed and selected for inclusion in this volume. They address topics related to graph-theoretic and algorithmic aspects of related complex networks, including citation networks, social networks, biological networks, molecular networks and other networks arising from the Internet.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32976 lei

Preț vechi: 41221 lei
-20% Nou

Puncte Express: 495
Preț estimativ în valută:
6312€ • 6564$ • 5289£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319035352
ISBN-10: 3319035355
Pagini: 244
Ilustrații: X, 233 p. 40 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.35 kg
Ediția:2013
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model.- A Spatial Preferential Attachment Model with Local Clustering.- A Local Clustering Algorithm for Connection.- On the Power of Adversarial Infections in Networks.- On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods.- A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks.- Evolution of the Media Web.- Random Intersection Graph Process.- Alpha Current Flow Betweenness Centrality.- Tree Nash Equilibria in the Network Creation Game.- Fast Low-Cost Estimation of Network Properties Using Random Walks.- An Lp Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model.- Fast Algorithms for the Maximum Clique Problem on Massive Sparse.- A Faster Algorithm to Update Betweenness Centrality after Node Alteration.- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient.- Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank.- Anarchy Is Free in Network Creation.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph, WAW 2013, held in Cambridge, MA, USA, in December 2013. The 17 papers presented were carefully reviewed and selected for inclusion in this volume. They address topics related to graph-theoretic and algorithmic aspects of related complex networks, including citation networks, social networks, biological networks, molecular networks and other networks arising from the Internet.

Caracteristici

State-of-the-art research Fast-track conference proceedings Unique visibility