scientific article

zbMath1297.05073MaRDI QIDQ2921736

Siddharth Suri, Sampath Kannan, Andrew McGregor, Joan Feigenbaum, Jian Zhang

Publication date: 13 October 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Randomized algorithms (68W20)

Related Items (20)

Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components ⋮ Graph spanners in the streaming model: An experimental study ⋮ Small stretch \((\alpha ,\beta )\)-spanners in the streaming model ⋮ Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models ⋮ Streaming deletion problems parameterized by vertex cover ⋮ Optimal per-edge processing times in the semi-streaming model ⋮ Streaming deletion problems Parameterized by vertex cover ⋮ Adapting parallel algorithms to the W-stream model, with applications to graph problems ⋮ Weighted matching in the semi-streaming model ⋮ Intractability of min- and max-cut in streaming graphs ⋮ Unnamed Item ⋮ Buyback Problem - Approximate Matroid Intersection with Cancellation Costs ⋮ New results for finding common neighborhoods in massive graphs in the data stream model ⋮ Streaming algorithm for graph spanners-single pass and constant processing time per edge ⋮ Best-order streaming model ⋮ Approximate shortest paths guided by a small index ⋮ The Greedy Spanner Is Existentially Optimal ⋮ Efficient distributed computation of distance sketches in networks ⋮ Depth First Search in the Semi-streaming Model ⋮ Light spanners for high dimensional norms via stochastic decompositions

This page was built for publication: