Graph distances in the streaming model: the value of space
From MaRDI portal
Recommendations
Cited in
(31)- Intractability of min- and max-cut in streaming graphs
- Light spanners for high dimensional norms via stochastic decompositions
- Streaming deletion problems parameterized by vertex cover
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Optimal per-edge processing times in the semi-streaming model
- Weighted matching in the semi-streaming model
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- Buyback problem -- approximate matroid intersection with cancellation costs
- Superlinear lower bounds for multipass graph processing
- Graph Distances in the Data-Stream Model
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- Dynamic graph stream algorithms in \(o(n)\) space
- The greedy spanner is existentially optimal
- Light spanners for high dimensional norms via stochastic decompositions
- Simulating random walks on graphs in the streaming model
- Depth First Search in the Semi-streaming Model
- Best-order streaming model
- Tight bounds for graph problems in insertion streams
- On Estimating Path Aggregates over Streaming Graphs
- scientific article; zbMATH DE number 7053290 (Why is no real title available?)
- Trading off space for passes in graph streaming problems
- Streaming deletion problems Parameterized by vertex cover
- A unified framework of light spanners. I: Fast (yet optimal) constructions
- On the edge crossings of the greedy spanner
- Improved approximation algorithms for (1,2)-TSP and Max-TSP using path covers in the semi-streaming model
- Efficient distributed computation of distance sketches in networks
- Graph spanners in the streaming model: An experimental study
- Small stretch ( , )-spanners in the streaming model
- 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
- Approximate shortest paths guided by a small index
This page was built for publication: Graph distances in the streaming model: the value of space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921736)
