Pages that link to "Item:Q3053148"

The following pages link to $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time (Q3053148):

Displaying 21 items.

• The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
• On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
• An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
• UPGMA and the normalized equidistant minimum evolution problem (Q1704587) (← links)
• \(d\)-dimensional arrangement revisited (Q2444745) (← links)
• Convergence and synchronization in networks of piecewise-smooth systems via distributed discontinuous coupling (Q2665094) (← links)
• Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
• The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
• Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
• (Q4228453) (← links)
• (Q4607980) (← links)
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
• The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous (Q4906501) (← links)
• Organisational hierarchy constructions with easy Kuramoto synchronisation (Q5061360) (← links)
• Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (Q5252687) (← links)
• Euclidean distortion and the sparsest cut (Q5423920) (← links)
• (Q5864920) (← links)
• Expander flows, geometric embeddings and graph partitioning (Q5899507) (← links)
• Expander flows, geometric embeddings and graph partitioning (Q5901073) (← links)
• Combinatorial Fiedler theory and graph partition (Q6118786) (← links)
• An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs (Q6130647) (← links)