Pages that link to "Item:Q4575676"
From MaRDI portal
The following pages link to Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model (Q4575676):
Displaying 15 items.
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← 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)
- High Probability Frequency Moment Sketches (Q5002734) (← links)
- (Q5090980) (← links)
- (Q5091196) (← links)
- Querying a Matrix Through Matrix-Vector Products. (Q5091255) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- (Q5121896) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
