The following pages link to (Q4228453):
Displaying 37 items.
- Spectral sparsification in the semi-streaming setting (Q372976) (← links)
- Information graph flow: a geometric approximation of quantum and statistical systems (Q725544) (← links)
- On computing minimum\((s,t)\)-cuts in digraphs (Q835038) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- Graph coarsening: from scientific computing to machine learning (Q2128866) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
- Vertex Sparsification in Trees (Q2971161) (← links)
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time (Q4562276) (← links)
- Drawing Big Graphs Using Spectral Sparsification (Q4625115) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- Ranking and Sparsifying a Connection Graph (Q4985350) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- (Q4999016) (← links)
- Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
- Recent developments in maximum flow algorithms (Q5054836) (← links)
- Shape Simplification Through Graph Sparsification (Q5082141) (← links)
- Sparsification of Binary CSPs (Q5090464) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- (Q5111733) (← links)
- Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- Sparsification of Binary CSPs (Q5220474) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (Q5252687) (← links)
- Sparsification of Two-Variable Valued Constraint Satisfaction Problems (Q5270406) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- (Q5743413) (← links)
- (Q5743414) (← links)
- (Q5743481) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6670816) (← links)
