Q5150500 (Q5150500): Difference between revisions

@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+On Exact Algorithms for Treewidth
@@ Property / cites work: On Exact Algorithms for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Computing the treewidth and the minimum fill-in with the modular decomposition
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
+Normal rank
@@ Property / cites work @@
+On treewidth approximations.
@@ Property / cites work: On treewidth approximations. / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and metaheuristic methods for computing graph treewidth
+Normal rank