menu
{ "item_title" : "Algorithms and Models for the Web Graph", "item_author" : [" Anthony Bonato", "Michael Mitzenmacher", "Pawel Pralat "], "item_description" : "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.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/31/903/535/3319035355_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithms and Models for the Web Graph|Anthony Bonato

Algorithms and Models for the Web Graph : 10th International Workshop, Waw 2013, Cambridge, Ma, Usa, December 14-15, 2013, Proceedings

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783319035352
  • ISBN-10: 3319035355
  • Publisher: Springer
  • Publish Date: November 2013
  • Dimensions: 9.21 x 6.14 x 0.51 inches
  • Shipping Weight: 0.76 pounds
  • Page Count: 233

Related Categories

You May Also Like...

    1

BAM Customer Reviews