Recent Advances in Multi-Pass Graph Streaming Lower Bounds Page 1 Recent Advances in
Multi-Pass Graph Streaming Lower Bounds Sepehr Assadi Cheriton School of Computer …

Hopsets and spanners are fundamental graph structures, playing a key role in shortest path
computation, distributed communication, and more. A (near-exact) hopset for a given graph …

This paper introduces stronger notions for approximate single-source shortest-path
distances and gives simple reductions to compute them from weaker standard notions of …

We provide Õ (∊–1)-pass semi-streaming algorithms for computing (1–∊)-approximate
maximum cardinality matchings in bipartite graphs. Our most efficient methods are …

For an n-vertex digraph G=(V, E), a shortcut set is a (small) subset of edges H taken from the
transitive closure of G that, when added to G guarantees that the diameter of G∪ H is small …

For an n-vertex digraph G=(V, E) and integer parameter D, a D-shortcut is a small set H of
directed edges taken from the transitive closure of G, satisfying that the diameter of G∪ H is …

We prove better lower bounds on additive spanners and emulators, which are lossy
compression schemes for undirected graphs, as well as lower bounds on shortcut sets …

We obtain improved lower bounds for additive spanners, additive emulators, and diameter-
reducing shortcut sets. Spanners and emulators are sparse graphs that approximately …

For a graph G, a D-diameter-reducing exact hopset is a small set of additional edges H that,
when added to G, maintains its graph metric but guarantees that all node pairs have a …

Computing strongly connected components (SCC) is among the most fundamental problems
in graph analytics. Given the large size of today's real-world graphs, parallel SCC …