Pages that link to "Item:Q5901073"
From MaRDI portal
The following pages link to Expander flows, geometric embeddings and graph partitioning (Q5901073):
Displaying 47 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Asymptotic negative type properties of finite ultrametric spaces (Q333917) (← 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)
- Unbalanced graph partitioning (Q372961) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- Graph clustering (Q458448) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
- Coarse differentiation and multi-flows in planar graphs (Q848676) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Clustering and outlier detection using isoperimetric number of trees (Q898224) (← links)
- Analysis of set-up time models: a metric perspective (Q935161) (← links)
- On average distortion of embedding metrics into the line (Q938313) (← links)
- Approximation algorithms for the Bipartite Multicut problem (Q991784) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- General variable neighborhood search for computing graph separators (Q1677293) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- On graph parameters guaranteeing fast sandpile diffusion (Q2260617) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Fréchet embeddings of negative type metrics (Q2471721) (← links)
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem (Q2507699) (← links)
- Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs (Q2573422) (← links)
- Metric extension operators, vertex sparsifiers and Lipschitz extendability (Q2630142) (← links)
- A semidefinite programming approach to the hypergraph minimum bisection problem (Q2996813) (← links)
- The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
- Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Linear time algorithms for approximating the facility terminal cover problem (Q3593378) (← links)
- (Q5002797) (← links)
- Euclidean distortion and the sparsest cut (Q5423920) (← links)
- (Q5743406) (← links)
- (Q5743436) (← links)
- Random Walks, Electric Networks and The Transience Class problem of Sandpiles (Q5743503) (← links)
- Advances in metric embedding theory (Q5894374) (← links)