Pages that link to "Item:Q2843271"
From MaRDI portal
The following pages link to Streaming and Communication Complexity of Clique Approximation (Q2843271):
Displaying 9 items.
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space (Q4575855) (← links)
- (Q5091196) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- Communication and Streaming Complexity of Approximate Pattern Matching (Q5110877) (← links)
- The one-way communication complexity of submodular maximization with applications to streaming and robustness (Q5145019) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)