The following pages link to (Q2921736):
Displaying 20 items.
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- Best-order streaming model (Q534570) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- Optimal per-edge processing times in the semi-streaming model (Q2380006) (← links)
- Weighted matching in the semi-streaming model (Q2428674) (← links)
- Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (Q2894245) (← links)
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- (Q5009588) (← links)
- Depth First Search in the Semi-streaming Model (Q5090492) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
