Algorithms and models for the web graph : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings / Anthony Bonato, Michael Mitzenmacher, Paweł Prałat (eds.).

By: (10th : WAW (Workshop) (10th : 2013 : Cambridge, Mass.)
Contributor(s): Bonato, Anthony, 1971- [editor.] | Mitzenmacher, Michael, 1969- [editor.] | Prałat, Paweł [editor.]
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 8305.; LNCS sublibrary: Publisher: Cham : Springer, 2013Description: 1 online resource (x, 233 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783319035369; 3319035363; 3319035355; 9783319035352Other title: WAW 2013Subject(s): Computer algorithms -- Congresses | Data mining -- Congresses | World Wide Web -- Congresses | Computer algorithms | Data mining | World Wide Web | computerwetenschappen | computer sciences | wiskunde | mathematics | algoritmen | algorithms | computeranalyse | computer analysis | informatieontsluiting | information retrieval | informatieopslag | information storage | datamining | data mining | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Ebook. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43 | W39 2013Online resources: Click here to access online
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.
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

International conference proceedings.

Includes author index.

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.

Online resource; title from PDF title page (SpringerLink, viewed December 10, 2013).

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.

There are no comments for this item.

to post a comment.

Powered by Koha