Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Models for the Web Graph

10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Anthony Bonato

    1. Department of Mathematics, Ryerson University, Toronto, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michael Mitzenmacher

    1. School of Engineering and Applied Sciences, Harvard University, Cambridge, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Paweł Prałat

    1. Department of Mathematics, Ryerson University, Toronto, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8305)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: WAW 2013.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (17 papers)

  1. Front Matter

    Download chapter PDF

  2. Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model

    • Jeannette Janssen, Paweł Prałat, Rory Wilson
    Pages 1-13

  3. A Spatial Preferential Attachment Model with Local Clustering

    • Emmanuel Jacob, Peter Mörters
    Pages 14-25

  4. A Local Clustering Algorithm for Connection Graphs

    • Fan Chung, Mark Kempton
    Pages 26-43

  5. On the Power of Adversarial Infections in Networks

    • Michael Brautbar, Moez Draief, Sanjeev Khanna
    Pages 44-55

  6. On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods

    • Konstantin Avrachenkov, Paulo Gonçalves, Marina Sokol
    Pages 56-67

  7. A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks

    • Kyle Kloster, David F. Gleich
    Pages 68-79

  8. Evolution of the Media Web

    • Damien Lefortier, Liudmila Ostroumova, Egor Samosvat
    Pages 80-92

  9. Random Intersection Graph Process

    • Mindaugas Bloznelis, Michał Karoński
    Pages 93-105

  10. Alpha Current Flow Betweenness Centrality

    • Konstantin Avrachenkov, Nelly Litvak, Vasily Medyanikov, Marina Sokol
    Pages 106-117

  11. Tree Nash Equilibria in the Network Creation Game

    • Akaki Mamageishvili, Matúš Mihalák, Dominik Müller
    Pages 118-129

  12. Fast Low-Cost Estimation of Network Properties Using Random Walks

    • Colin Cooper, Tomasz Radzik, Yiannis Siantos
    Pages 130-143

  13. An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model

    • Rupei Xu
    Pages 144-155

  14. Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

    • Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao, Alok Choudhary
    Pages 156-169

  15. A Faster Algorithm to Update Betweenness Centrality after Node Alteration

    • Keshav Goel, Rishi Ranjan Singh, Sudarshan Iyengar, Sukrit
    Pages 170-184

  16. Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient

    • Liudmila Ostroumova, Alexander Ryabchenko, Egor Samosvat
    Pages 185-202

  17. Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank

    • Fan Chung, Olivia Simpson
    Pages 203-219

  18. Anarchy Is Free in Network Creation

    • Ronald Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh
    Pages 220-231

  19. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Algorithms and Models for the Web Graph

Keywords

About this book

This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph, WAW 2013, held in Cambridge, MA, USA, in December 2013. The 17 papers presented were carefully reviewed and selected for inclusion in this volume. They address topics related to graph-theoretic and algorithmic aspects of related complex networks, including citation networks, social networks, biological networks, molecular networks and other networks arising from the Internet.

Editors and Affiliations

  • Department of Mathematics, Ryerson University, Toronto, Canada

    Anthony Bonato, Paweł Prałat

  • School of Engineering and Applied Sciences, Harvard University, Cambridge, USA

    Michael Mitzenmacher

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation