The complexity of finding uniform sparsest cuts in various graph classes (Q450559): Difference between revisions

@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsest cuts and concurrent flows in product graphs.
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for finding sparsest cuts in various graph classes
+Normal rank
@@ Property / cites work @@
+The Complexity Status of Problems Related to Sparsest Cuts
+Normal rank
@@ Property / cites work @@
+Approximating Sparsest Cut in Graphs of Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
+Normal rank
@@ Property / cites work @@
+Q4508369
@@ Property / cites work: Q4508369 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Clustering large graphs via the singular value decomposition
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417642
@@ Property / cites work: Q5417642 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762518
@@ Property / cites work: Q2762518 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Sparsest cuts and bottlenecks in graphs
@@ Property / cites work: Sparsest cuts and bottlenecks in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank