Computing Tree Decompositions (Q5042458): Difference between revisions

@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036592
@@ Property / cites work: Q4036592 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Constructive linear time algorithms for branchwidth
+Normal rank
@@ Property / cites work @@
+Definability equals recognizability for graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q4636613
@@ Property / cites work: Q4636613 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalent definitions of recognizability for sets of graphs of bounded tree-width
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111890
@@ Property / cites work: Q5111890 / rank @@
+Normal rank
@@ Property / cites work @@
+Canonizing Graphs of Bounded Tree Width in Logspace
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+Query evaluation via tree-decompositions
@@ Property / cites work: Query evaluation via tree-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Cutwidth: obstructions and algorithmic aspects
@@ Property / cites work: Cutwidth: obstructions and algorithmic aspects / rank @@
+Normal rank
@@ Property / cites work @@
+Constructive algorithm for path-width of matroids
@@ Property / cites work: Constructive algorithm for path-width of matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Finding branch-decompositions of matroids, hypergraphs, and more
+Normal rank
@@ Property / cites work @@
+Upper bounds on the size of obstructions and intertwines
+Normal rank
@@ Property / cites work @@
+Q4036591
@@ Property / cites work: Q4036591 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
+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 @@
+Graph expansion and the unique games conjecture
@@ Property / cites work: Graph expansion and the unique games conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472491
@@ Property / cites work: Q4472491 / rank @@
+Normal rank
@@ Property / cites work @@
+Cutwidth I: A linear time fixed parameter algorithm
+Normal rank
@@ Property / cites work @@
+Cutwidth II: Algorithms for partial w-trees of bounded degree
+Normal rank
@@ Property / cites work @@
+Inapproximability of Treewidth and Related Problems
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank