Algorithms and Models for the Web Graph

10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings

Häftad, Engelska, 2013

Av Anthony Bonato, Michael Mitzenmacher, Pawel Pralat

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2013-11-11
Mått155 x 235 x undefined mm
FormatHäftad
SpråkEngelska
SerieTheoretical Computer Science and General Issues
Antal sidor233
FörlagSpringer International Publishing AG
ISBN9783319035352

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och it

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.