Constant-degree graph expansions that preserve treewidth (Q633842): Difference between revisions

@@ Property / cites work @@
+NP-hard graph problems and boundary classes of graphs
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Q3128896
@@ Property / cites work: Q3128896 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+Bucket elimination: A unifying framework for reasoning
+Normal rank
@@ Property / cites work @@
+Network-based heuristics for constraint-satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q4734791
@@ Property / cites work: Q4734791 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulating Quantum Computation by Contracting Tensor Networks
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank