Pages that link to "Item:Q1741857"
From MaRDI portal
The following pages link to Dynamic graph stream algorithms in \(o(n)\) space (Q1741857):
Displaying 14 items.
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Labeled graph sketches: keeping up with real-time graph streams (Q2224937) (← links)
- Space lower bounds for graph stream problems (Q2327510) (← links)
- Algorithms on evolving graphs (Q2826051) (← links)
- Streamed Graph Drawing and the File Maintenance Problem (Q2867663) (← links)
- Graph distances in the streaming model: the value of space (Q2921736) (← links)
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (Q2941505) (← links)
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs (Q2980917) (← links)
- A space-optimal data-stream algorithm for coresets in the plane (Q3602850) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- Average Sensitivity of Graph Algorithms (Q6046751) (← links)
- (Q6084359) (← links)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)