This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Models for the Web-Graph, WAW 2010, held in Stanford, CA, USA, in December 2010, which was co-located with the 6th International Workshop on Internet and Network Economics (WINE 2010). The 13 revise
Algorithms and Models for the Web Graph: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings
✍ Scribed by Jeannette Janssen, Paweł Prałat, Rory Wilson (auth.), Anthony Bonato, Michael Mitzenmacher, Paweł Prałat (eds.)
- Publisher
- Springer International Publishing
- Year
- 2013
- Tongue
- English
- Leaves
- 241
- Series
- Lecture Notes in Computer Science 8305 Theoretical Computer Science and General Issues
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
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.
✦ Table of Contents
Front Matter....Pages -
Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model....Pages 1-13
A Spatial Preferential Attachment Model with Local Clustering....Pages 14-25
A Local Clustering Algorithm for Connection Graphs....Pages 26-43
On the Power of Adversarial Infections in Networks....Pages 44-55
On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods....Pages 56-67
A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks....Pages 68-79
Evolution of the Media Web....Pages 80-92
Random Intersection Graph Process....Pages 93-105
Alpha Current Flow Betweenness Centrality....Pages 106-117
Tree Nash Equilibria in the Network Creation Game....Pages 118-129
Fast Low-Cost Estimation of Network Properties Using Random Walks....Pages 130-143
An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model....Pages 144-155
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs....Pages 156-169
A Faster Algorithm to Update Betweenness Centrality after Node Alteration....Pages 170-184
Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient....Pages 185-202
Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank....Pages 203-219
Anarchy Is Free in Network Creation....Pages 220-231
Back Matter....Pages -
✦ Subjects
Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Data Mining and Knowledge Discovery; Information Storage and Retrieval
📜 SIMILAR VOLUMES
<p><p>This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Models for the Web-Graph, WAW 2010, held in Stanford, CA, USA, in December 2010, which was co-located with the 6th International Workshop on Internet and Network Economics (WINE 2010).</p><p>The
<p><p>This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Models for the Web-Graph, WAW 2010, held in Stanford, CA, USA, in December 2010, which was co-located with the 6th International Workshop on Internet and Network Economics (WINE 2010).</p><p>The
<p>This book constitutes the proceedings of the 13th International Workshop on Algorithms and Models for the Web Graph, WAW 2016, held in Montreal, QC, Canada, in December 2016.<br>The 13 full papers presented in this volume were carefully reviewed and selected from 14 submissions. The workshop gath
<p><p>This book constitutes the proceedings of the 12th International Workshop on Algorithms and Models for the Web Graph, WAW 2015, held in Eindhoven, The Netherlands, in December 2015. </p><p>The 15 full papers presented in this volume were carefully reviewed and selected from 24 submissions. They