Algorithms and Models for the Web Graph: 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6-7, 2019, Proceedings

Algorithms and Models for the Web Graph: 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6-7, 2019, Proceedings

by Konstantin Avrachenkov, Pawel Pralat, Nan Ye
ISBN-10:
3030250695
ISBN-13:
9783030250690
Pub. Date:
07/05/2019
Publisher:
Springer International Publishing
ISBN-10:
3030250695
ISBN-13:
9783030250690
Pub. Date:
07/05/2019
Publisher:
Springer International Publishing
Algorithms and Models for the Web Graph: 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6-7, 2019, Proceedings

Algorithms and Models for the Web Graph: 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6-7, 2019, Proceedings

by Konstantin Avrachenkov, Pawel Pralat, Nan Ye
$54.99
Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

This book constitutes the proceedings of the 16th International Workshop on Algorithms and Models for the Web Graph, WAW 2019, held in Brisbane, QLD, Australia, in July 2019.
The 9 full papers presented in this volume were carefully reviewed and selected from 13 submissions. The papers cover topics of all aspects of algorithmic and mathematical research in the areas pertaining to the World Wide Web, espousing the view of complex data as networks.


Product Details

ISBN-13: 9783030250690
Publisher: Springer International Publishing
Publication date: 07/05/2019
Series: Lecture Notes in Computer Science , #11631
Edition description: 1st ed. 2019
Pages: 131
Product dimensions: 6.10(w) x 9.25(h) x (d)

Table of Contents

Using Synthetic Networks for Parameter Tuning in Community Detection.- Efficiency of Transformations of Proximity Measures for Graph Clustering.- Almost Exact Recovery in Label Spreading.- Strongly n-e.c. Graphs and Independent Distinguishing Labellings.- The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs.- Estimating the Parameters of the Waxman Random Graph.- Understanding the Effectiveness of Data Reduction in Public Transportation Networks.- A Spatial Small-World Graph Arising from Activity-Based Reinforcement.- SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs.

From the B&N Reads Blog

Customer Reviews