The following pages link to (Q5743414):
Displaying 18 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- The Densest $k$-Subhypergraph Problem (Q3174693) (← 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)
- (Q5090428) (← links)
- (Q5090980) (← links)
- (Q5091196) (← 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)
- (Q5875530) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- (Q6062143) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
