The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs

14 Nov 2016 Cormode Graham Jowhari Hossein Monemizadeh Morteza Muthukrishnan S.

Estimating the size of the maximum matching is a canonical problem in graph algorithms, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS

Datasets


  Add Datasets introduced or used in this paper