Pages that link to "Item:Q3167399"

The following pages link to Maximum Matching in Semi-streaming with Few Passes (Q3167399):

Displaying 15 items.

• Superlinear lower bounds for multipass graph processing (Q343847) (← 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)
• Graph sketching and streaming: new approaches for analyzing massive graphs (Q2399360) (← links)
• Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
• Maximum Matching in Turnstile Streams (Q3452845) (← links)
• Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
• A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
• (Q5090980) (← 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)
• On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
• Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
• (Q6084359) (← links)
• Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)