Pages that link to "Item:Q5899507"
From MaRDI portal
The following pages link to Expander flows, geometric embeddings and graph partitioning (Q5899507):
Displaying 35 items.
- Communities, Random Walks, and Social Sybil Defense (Q4985360) (← links)
- A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Approximating sparsest cut in low rank graphs via embeddings from approximately low-dimensional spaces (Q5002624) (← links)
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)
- (Q5005186) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Time optimal consensus tracking with multiple leaders (Q5018839) (← links)
- Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
- Large data limit for a phase transition model with the <i>p</i>-Laplacian on point clouds (Q5056700) (← links)
- On the Structure of Isometrically Embeddable Metric Spaces (Q5071129) (← links)
- (Q5088977) (← links)
- (Q5090440) (← links)
- (Q5091238) (← links)
- (Q5091271) (← links)
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces (Q5115789) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
- Local Flow Partitioning for Faster Edge Connectivity (Q5210551) (← links)
- (Q5214264) (← links)
- Minimum Congestion Mapping in a Cloud (Q5258917) (← links)
- Comparison of Metric Spectral Gaps (Q5402099) (← links)
- OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING (Q5411798) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
- (Q5875482) (← links)
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance (Q5883297) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Expander flows, geometric embeddings and graph partitioning (Q5901073) (← links)
- Iterated multilevel simulated annealing for large-scale graph conductance minimization (Q6071282) (← links)
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
- An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs (Q6130647) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
- Adversarial bandits with knapsacks (Q6551256) (← links)
- On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems (Q6559388) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time (Q6589758) (← links)
