Practical algorithms on partial k-trees with an application to domination-like problems (Q5060153): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-57155-8_284
+Normal rank
@@ Property / OpenAlex ID @@
+W1580414818
@@ Property / OpenAlex ID: W1580414818 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterization and Recognition of Partial 3-Trees
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Linear-time computation of optimal subgraphs of decomposable graphs
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385515
@@ Property / cites work: Q4385515 / 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 @@
+Q3198869
@@ Property / cites work: Q3198869 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Linear-time computability of combinatorial problems on series-parallel graphs
+Normal rank