Algorithms and models for the web graph : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, proceedings
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...
Guardat en:
| Altres autors: | , , |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Cham :
Springer International Publishing
[20..].
Cham : Springer Nature |
| Col·lecció: | Theoretical Computer Science and General Issues
8305 |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms and Models for the Web Graph, Texte imprimé, 9783319035352 • Algorithms and Models for the Web Graph, Texte imprimé, 9783319035376 |
Taula de continguts:
- 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.