Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Models for the Web Graph de Bogumi¿ Kami¿ski

Algorithms and Models for the Web Graph: Lecture Notes in Computer Science, cartea 12091

Editat de Bogumi¿ Kami¿ski, Pawe¿ Pra¿at, Przemys¿aw Szufel
en Limba Engleză Paperback – 14 mai 2020
This book constitutes the proceedings of the 17th International Workshop on Algorithms and Models for the Web Graph, WAW 2020, held in Warsaw, Poland, in September 2020. The 12 full papers presented in this volume were carefully reviewed and selected from 19 submissions. 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.
Due to the corona pandemic the conference was postponed from June 2020 to September 2020.



Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31623 lei

Preț vechi: 39528 lei
-20%

Puncte Express: 474

Carte tipărită la comandă

Livrare economică 28 iulie-11 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030484774
ISBN-10: 3030484777
Pagini: 184
Ilustrații: X, 173 p. 40 illus., 29 illus. in color.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.29 kg
Ediția:1st ed. 2020
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Hypergraph Analytics of Domain Name System Relationships.- Global Graph Curvature.- Information Diffusion in Complex Networks: a Model Based on Hypergraphs and its Analysis.- A Scalable Unsupervised Framework for Comparing Graph Embeddings.- Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions.- Clustering Coefficient of a Preferred Attachment Affiliation Network.- Transience Versus Recurrence for Scale-Free Spatial Networks.- The Iterated Local Directed Transitivity Model for Social Networks.- A note on the conductance of the binomial random intersection graph.- Iterated Global Models for Complex Networks.- A Robust Method for Statistical Testing of Empirical Power-Law Distributions.- Community Structures in Information Networks for a Discrete Agent Population.