activity
20102023
most citedA Second Look at Counting Triangles in Graph Streams (revised)

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.DS2016

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

Graham Cormode, Hossein Jowhari, Morteza Monemizadeh +1

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. W…