Pages that link to "Item:Q5899507"
From MaRDI portal
The following pages link to Expander flows, geometric embeddings and graph partitioning (Q5899507):
Displayed 50 items.
- Continuum limit of total variation on point clouds (Q261295) (← links)
- A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
- A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- A class of semidefinite programs with rank-one solutions (Q551300) (← links)
- A variational approach to the consistency of spectral clustering (Q723005) (← links)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- Variational perspective on local graph clustering (Q1739051) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- Convex programming based spectral clustering (Q2051294) (← links)
- From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds (Q2138635) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394) (← links)
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481) (← links)
- Bounds on maximum concurrent flow in random bipartite graphs (Q2228396) (← links)
- The Small Set Vertex expansion problem (Q2232595) (← links)
- Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem (Q2273653) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Terminal embeddings (Q2405893) (← links)
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors (Q2419023) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- \(d\)-dimensional arrangement revisited (Q2444745) (← links)
- Negative-type diversities, a multi-dimensional analogue of negative-type metrics (Q2659479) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Combinatorial theorems about embedding trees on the real line (Q3005116) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Consistency of Dirichlet Partitions (Q4592868) (← links)
- Effective Resistance Preserving Directed Graph Symmetrization (Q4615300) (← links)
- 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)
- (Q5002624) (← links)
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)