On the complexity of isoperimetric problems on trees (Q765346): Difference between revisions

@@ Property / arXiv ID @@
+.0706
@@ Property / arXiv ID: 1009.0706 / rank @@
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+Q3876353
@@ Property / cites work: Q3876353 / rank @@
+Normal rank
@@ Property / cites work @@
+The shifting algorithm technique for the partitioning of trees
+Normal rank
@@ Property / cites work @@
+Q5387695
@@ Property / cites work: Q5387695 / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted graph Laplacians and isoperimetric inequalities
+Normal rank
@@ Property / cites work @@
+On the isoperimetric spectrum of graphs and its approximations
+Normal rank
@@ Property / cites work @@
+On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
+Normal rank
@@ Property / cites work @@
+Graph Clustering and Minimum Cut Trees
@@ Property / cites work: Graph Clustering and Minimum Cut Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4458414
@@ Property / cites work: Q4458414 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Representation of Balanced Parentheses and Static Trees
+Normal rank
@@ Property / cites work @@
+Computing sharp bounds for hard clustering problems on trees
+Normal rank
@@ Property / cites work @@
+Q3976405
@@ Property / cites work: Q3976405 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
+Normal rank
@@ Property / cites work @@
+Isoperimetric numbers of graphs
@@ Property / cites work: Isoperimetric numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Graph Connectivity
@@ Property / cites work: Algorithmic Aspects of Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost subpartitions in graphs
@@ Property / cites work: Minimum cost subpartitions in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking the multicommodity flow barrier for o(√log n)-approximations to sparsest cut
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS
+Normal rank