Pages that link to "Item:Q5351915"
From MaRDI portal
The following pages link to Tight Bounds for Graph Problems in Insertion Streams (Q5351915):
Displaying 10 items.
- Optimal insertion in deterministic DAWGs (Q1399983) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Space lower bounds for graph stream problems (Q2327510) (← links)
- Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
- Tight bounds for the performance of Longest In System on DAGs (Q3022748) (← links)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
- Beating CountSketch for heavy hitters in insertion streams (Q5361876) (← links)
- A one pass streaming algorithm for finding Euler tours (Q6174649) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)