Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Algorithms and Models for the Web Graph - 10th International Workshop, WAW 2013, Cambridge, MA,

Algorithms and Models for the Web Graph

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

Bonato, Anthony, Mitzenmacher, Michael, Prałat, Paweł (Eds.)

2013, X, 233 p. 40 illus.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-319-03536-9

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-319-03535-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility
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.

Content Level » Research

Keywords » algorithms on graphs - clustering - machine learning - social networks - spatial preferences

Related subjects » Database Management & Information Retrieval - Theoretical Computer Science

Table of contents 

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.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.