Pages that link to "Item:Q2989051"
From MaRDI portal
The following pages link to Sketching Cuts in Graphs and Hypergraphs (Q2989051):
Displaying 15 items.
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs (Q2689813) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- (Q4993305) (← links)
- Sublinear Algorithms for MAXCUT and Correlation Clustering (Q5002682) (← links)
- (Q5075787) (← links)
- Sparsification of Binary CSPs (Q5090464) (← links)
- Sparsification of Binary CSPs (Q5220474) (← links)
- Sparsification of Two-Variable Valued Constraint Satisfaction Problems (Q5270406) (← links)
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. (Q6084360) (← links)
- Streaming approximation resistance of every ordering CSP (Q6581871) (← links)
