Small stretch ( , )-spanners in the streaming model
From MaRDI portal
Publication:838152
DOI10.1016/J.TCS.2008.04.022zbMATH Open1191.68819DBLPjournals/tcs/AusielloFI09OpenAlexW2067528822WikidataQ61609541 ScholiaQ61609541MaRDI QIDQ838152FDOQ838152
Authors: Giorgio Ausiello, Paolo G. Franciosa, Giuseppe F. Italiano 
Publication date: 21 August 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.022
Recommendations
- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
- Graph spanners in the streaming model: An experimental study
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Efficient algorithms for constructing \((1+{\epsilon}, {\beta})\)-spanners in the distributed and streaming models
- Computing graph spanners in small memory: fault-tolerance and streaming
Cites Work
- Introduction to algorithms
- Reconstructing the shape of a tree from observed dissimilarity data
- There are planar graphs almost as good as the complete graph
- Complexity of network synchronization
- An Optimal Synchronizer for the Hypercube
- On sparse spanners of weighted graphs
- Graph spanners
- Grid spanners
- Additive graph spanners
- Automata, Languages and Programming
- Delaunay graphs are almost as good as complete graphs
- Small Stretch Spanners on Dynamic Graphs
- Dynamic Algorithms for Graph Spanners
- Title not available (Why is that?)
- Graph distances in the streaming model: the value of space
- NP-completeness of minimum spanner problems
- Title not available (Why is that?)
- New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners
- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
- Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
Cited In (6)
- Computing graph spanners in small memory: fault-tolerance and streaming
- Computing graph spanners in small memory: fault-tolerance and streaming
- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
- Graph distances in the streaming model: the value of space
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Efficient algorithms for constructing \((1+{\epsilon}, {\beta})\)-spanners in the distributed and streaming models
This page was built for publication: Small stretch \((\alpha ,\beta )\)-spanners in the streaming model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838152)
