Fast balanced partitioning is hard even on grids and trees (Q388790): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2013.03.014
@@ Property / DOI: 10.1016/j.tcs.2013.03.014 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+PT-Scotch
@@ Property / describes a project that uses: PT-Scotch / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2005606079
@@ Property / OpenAlex ID: W2005606079 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6745
@@ Property / arXiv ID: 1111.6745 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced graph partitioning
@@ Property / cites work: Balanced graph partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+A scalable multi-level preconditioner for matrix-free µ-finite element analysis of human bone structures
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+A framework for solving VLSI graph layout problems
+Normal rank
@@ Property / cites work @@
+Parallel approximation schemes for problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Highly connected sets and the excluded grid theorem
+Normal rank
@@ Property / cites work @@
+Edge Separators of Planar and Outerplanar Graphs With Applications
+Normal rank
@@ Property / cites work @@
+Q5702543
@@ Property / cites work: Q5702543 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximate Graph Partitioning Algorithms
@@ Property / cites work: Fast Approximate Graph Partitioning Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Balanced Partitioning Is Hard Even on Grids and Trees
+Normal rank
@@ Property / cites work @@
+Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons
+Normal rank
@@ Property / cites work @@
+Q2904753
@@ Property / cites work: Q2904753 / rank @@
+Normal rank
@@ Property / cites work @@
+An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
+Normal rank
@@ Property / cites work @@
+Excluded minors, network decomposition, and multicommodity flow
+Normal rank
@@ Property / cites work @@
+Q4633907
@@ Property / cites work: Q4633907 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The bisection width of grid graphs
@@ Property / cites work: The bisection width of grid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-quotient cuts in planar graphs
@@ Property / cites work: Finding minimum-quotient cuts in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+How Good is Recursive Bisection?
@@ Property / cites work: How Good is Recursive Bisection? / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2013.03.014
@@ Property / DOI: 10.1016/J.TCS.2013.03.014 / rank @@
+Normal rank