In the second lecture, we discussed algorithms for graph streams. Here we observe a sequence of edges and the goal is to estimate properties of the underlying graph without storing all the edges. The slides are here:

We covered:

*Spanners:* If you judiciously store only a subset of the edges, you can ensure that the distance between any two nodes in the subgraph is only a constant factor larger than the distance in the entire graph.
*Sparsifiers:* Here you also remember a subset of edges but also apply weights to these edges such that the capacity of every cut is preserved up to a small factor. We show how to do this incrementally.
*Sketching:* All this talk of remembering a subset of the edges is all very well but what if we’re dealing with a fully dynamic graph where edges are both added and deleted. Can we still compute interesting graph properties if we can’t be sure the edges we remember wouldn’t subsequently be deleted? You’ll have to see the slides to find out. Or see this SODA paper.

**Lunch Break!** If you want to fully recreate the experience of a French workshop, I suggest you now find yourself a plate of oysters and break for lunch. Lectures will resume shortly.

### Like this:

Like Loading...

*Related*

## 2 comments

Comments feed for this article

April 3, 2012 at 8:36 am

arifa pic with orange is great

April 13, 2012 at 9:10 am

EPIT Lectures: Lower Bounds «[…] up in the mini-course on data streams (first two lectures here and here) were lower bounds and communication complexity. The slides are […]