On graph problems in a semi-streaming model
From MaRDI portal
Recommendations
Cited in
(41)- On finding common neighborhoods in massive graphs.
- Intractability of min- and max-cut in streaming graphs
- Labeled graph sketches: keeping up with real-time graph streams
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Optimal per-edge processing times in the semi-streaming model
- Graph sketching and streaming: new approaches for analyzing massive graphs
- Weighted matching in the semi-streaming model
- Bipartite matching in the semi-streaming model
- On graph problems in a semi-streaming model
- Streamed Graph Drawing and the File Maintenance Problem
- Computing strongly connected components in the streaming model
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Superlinear lower bounds for multipass graph processing
- Finding articulation points of large graphs in linear time
- Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
- Best-Order Streaming Model
- Graph Sparsification in the Semi-streaming Model
- Bipartite Graph Matchings in the Semi-streaming Model
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- Semi-streaming algorithms for annotated graph streams
- A streaming algorithm for the undirected longest path problem
- Streaming and massively parallel algorithms for edge coloring
- Simulating random walks on graphs in the streaming model
- Depth First Search in the Semi-streaming Model
- Independent sets in vertex-arrival streams
- A Survey of Graph Algorithms Under Extended Streaming Models of Computation
- Computing the degeneracy of large graphs
- Trading off space for passes in graph streaming problems
- Deterministic graph coloring in the streaming model
- Graph coloring via degeneracy in streaming and other space-conscious models
- Streaming edge coloring with asymptotically optimal colors
- Streaming algorithms for connectivity augmentation
- Temporal separators with deadlines
- Simple streaming algorithms for edge coloring
- Near-optimal two-pass streaming algorithm for sampling random walks over directed graphs
- New algorithms and lower bounds for streaming tournaments
- Almost optimal superconstant-pass streaming lower bounds for reachability
- Streaming maximal matching with bounded deletions
- Graph spanners in the streaming model: An experimental study
- 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
This page was built for publication: On graph problems in a semi-streaming model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466491)