Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858): Difference between revisions

@@ 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.1007/978-3-642-11269-0_12
+Normal rank
@@ Property / OpenAlex ID @@
+W1553996844
@@ Property / OpenAlex ID: W1553996844 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Subgraphs and well‐quasi‐ordering
@@ Property / cites work: Subgraphs and well‐quasi‐ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798235
@@ Property / cites work: Q3798235 / rank @@
+Normal rank
@@ Property / cites work @@
+On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
+Normal rank
@@ Property / cites work @@
+Q5734436
@@ Property / cites work: Q5734436 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank