Pages that link to "Item:Q4575856"
From MaRDI portal
The following pages link to On Estimating Maximum Matching Size in Graph Streams (Q4575856):
Displaying 19 items.
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams (Q4575674) (← links)
- Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
- (Q5090980) (← 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)
- Approximate Maximum Matching in Random Streams (Q5146889) (← links)
- On Approximating Matrix Norms in Data Streams (Q5244397) (← links)
- Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond (Q5363103) (← links)
- Parameterized Streaming: Maximal Matching and Vertex Cover (Q5363104) (← links)
- (Q5875530) (← links)
- (Q6062143) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
- Improved bounds for matching in random-order streams (Q6614611) (← links)
