Cantitate/Preț
Produs

Algorithms and Models for the Web Graph: 11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8882

Editat de Anthony Bonato, Fan Chung Graham, Paweł Prałat
en Limba Engleză Paperback – 25 noi 2014
This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms and Models for the Web Graph, WAW 2014, held in Beijing, China, in December 2014.
The 12 papers presented were carefully reviewed and selected for inclusion in this volume. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop gathered the researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 26395 lei  6-8 săpt.
  Springer International Publishing – 25 noi 2014 26395 lei  6-8 săpt.
  Springer International Publishing – 6 sep 2017 31696 lei  6-8 săpt.
  Springer International Publishing – 11 noi 2016 31989 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 26395 lei

Preț vechi: 32993 lei
-20% Nou

Puncte Express: 396

Preț estimativ în valută:
5055 5302$ 4193£

Carte tipărită la comandă

Livrare economică 28 ianuarie-11 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319131221
ISBN-10: 3319131222
Pagini: 161
Ilustrații: IX, 161 p. 30 illus.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.25 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Clustering and the Hyperbolic Geometry of Complex Networks.- Burning a Graph as a Model of Social Contagion.- Personalized PageRank with Node-Dependent Restart.- Efficient Computation of the Weighted Clustering Coefficient.- Global Clustering Coefficient in Scale-Free Networks.- Efficient Primal-Dual Graph Algorithms for MapReduce.- Computing Diffusion State Distance Using Green’s Function and Heat Kernel on Graphs.- Relational Topic Factorization for Link Prediction in Document Networks.- Firefighting as a Game.- PageRank in Scale-Free Random Graphs.- Modelling of Trends in Twitter Using Retweet Graph Dynamics.- LiveRank: How to Refresh Old Crawls. 

Caracteristici

Includes supplementary material: sn.pub/extras