Minimum size tree-decompositions (Q5916057): Difference between revisions

@@ Property / describes a project that uses @@
+ComputeTW
@@ Property / describes a project that uses: ComputeTW / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 447
@@ Property / describes a project that uses: Algorithm 447 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2017.01.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2590602068
@@ Property / OpenAlex ID: W2590602068 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Characterization and Recognition of Partial 3-Trees
+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 @@
+Treewidth computations. II. Lower bounds
@@ Property / cites work: Treewidth computations. II. Lower bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Time Algorithms for Finding Small Tree and Path Decompositions
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The complexity of minimum-length path decompositions
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterization of partial 3-trees in terms of three structures
+Normal rank
@@ Property / cites work @@
+Minimum size tree-decompositions
@@ Property / cites work: Minimum size tree-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms finding tree-decompositions of graphs
@@ Property / cites work: Algorithms finding tree-decompositions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+On Linear Recognition of Tree-Width at Most Four
@@ Property / cites work: On Linear Recognition of Tree-Width at Most Four / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of outerplanar graphs
@@ Property / cites work: Characterizations of outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5916057