Algorithms and Models for the Web Graph
10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings
Published on 11. November 2013
Book
Paperback/Softback
X, 233 pages
978-3-319-03535-2 (ISBN)
Description
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.
More details
Series
Edition
2013 ed.
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Research
Illustrations
40 s/w Abbildungen
X, 233 p. 40 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 14 mm
Weight
376 gr
ISBN-13
978-3-319-03535-2 (9783319035352)
DOI
10.1007/978-3-319-03536-9
Schweitzer Classification
Other editions
Additional editions
Anthony Bonato | Michael Mitzenmacher | Pawel Pralat
Algorithms and Models for the Web Graph
10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings
E-Book
12/2013
Springer
€53.49
Available for download
Content
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.