Algorithms and Models for the Web Graph : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings / edited by Anthony Bonato, Michael Mitzenmacher, Pawel Pralat.

Format:

Book

Contributor:

Bonato, Anthony, 1971- editor.

Mitzenmacher, Michael, 1969- editor.

Prałat, Paweł, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 8305.

Theoretical Computer Science and General Issues ; 8305

Language:

English

Subjects (All):

Algorithms.

Computer science--Mathematics.

Computer science.

Data mining.

Information storage and retrieval.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Mining and Knowledge Discovery.

Information Storage and Retrieval.

Local Subjects:

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Mining and Knowledge Discovery.

Information Storage and Retrieval.

Physical Description:

1 online resource (X, 233 pages) : 40 illustrations.

Edition:

First edition 2013.

Contained In:

Springer eBooks

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2013.

System Details:

text file PDF

Summary:

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.

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.

Other Format:

Printed edition:

ISBN:

978-3-319-03536-9

9783319035369

Access Restriction:

Restricted for use by site license.