Algorithms and Models for the Web Graph: 15th International Workshop Front Cover

Algorithms and Models for the Web Graph: 15th International Workshop

  • Length: 185 pages
  • Edition: 1st ed. 2018
  • Publisher:
  • Publication Date: 2018-07-08
  • ISBN-10: 3319928708
  • ISBN-13: 9783319928708
Description

Algorithms and Models for the Web Graph: 15th International Workshop, WAW 2018, Moscow, Russia, May 17-18, 2018, Proceedings (Lecture Notes in Computer Science)

This book constitutes the proceedings of the 15th International Workshop on Algorithms and Models for the Web Graph, WAW 2018, held in Moscow, Russia in May 2018.

The 11 full papers presented in this volume were carefully reviewed  and selected from various submissions. The papers focus on topics like the information retrieval and data mining on the Web; Web as a text repository and as a graph, induced in various ways by link among pages, hosts and users; the understanding of graphs that arise from the Web and various user activities on the Web; stimulation of the development of high-performance algorithms and applications that exploit these graphs.

Table of Contents

Chapter 1. Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs
Chapter 2. The Asymptotic Normality of the Global Clustering Coefficient in Sparse Random Intersection Graphs
Chapter 3. Clustering Properties of Spatial Preferential Attachment Model
Chapter 4. Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
Chapter 5. Joint Alignment from Pairwise Differences with a Noisy Oracle
Chapter 6. Analysis of Relaxation Time in Random Walk with Jumps
Chapter 7. QAP Analysis of Company Co-mention Network
Chapter 8. Towards a Systematic Evaluation of Generative Network Models
Chapter 9. Dynamic Competition Networks: Detecting Alliances and Leaders
Chapter 10. An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data
Chapter 11. A Statistical Performance Analysis of Graph Clustering Algorithms

To access the link, solve the captcha.