Dynamic graph stream algorithms in o(n) space
From MaRDI portal
Publication:4598151
DOI10.4230/LIPICS.ICALP.2016.18zbMATH Open1388.68231arXiv1605.00089MaRDI QIDQ4598151FDOQ4598151
Authors: Zengfeng Huang, Pan Peng 
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1605.00089
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Cited In (17)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams
- Streamed Graph Drawing and the File Maintenance Problem
- Labeled graph sketches: keeping up with real-time graph streams
- Densest subgraph in dynamic graph streams
- Trading off space for passes in graph streaming problems
- Estimating graph parameters from random order streams
- Tight bounds for graph problems in insertion streams
- Dynamic graph stream algorithms in \(o(n)\) space
- Space lower bounds for graph stream problems
- Average Sensitivity of Graph Algorithms
- Graph spanners in the streaming model: An experimental study
- On Estimating Path Aggregates over Streaming Graphs
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Optimal lower bounds for distributed and streaming spanning forest computation
- Algorithms on evolving graphs
- Graph distances in the streaming model: the value of space
- (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond
This page was built for publication: Dynamic graph stream algorithms in \(o(n)\) space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598151)
