Pages that link to "Item:Q3452791"
From MaRDI portal
The following pages link to Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791):
Displaying 10 items.
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Almost-smooth histograms and sliding-window graph algorithms (Q2088588) (← links)
- Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
- Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
- (Q5090980) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- (Q5240429) (← links)
- On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
- Improved bounds for matching in random-order streams (Q6614611) (← links)
