\(k\)-NLC graphs and polynomial algorithms (Q1336631): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+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 @@
+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 @@
+Q3222874
@@ Property / cites work: Q3222874 / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatic definition of context-free rewriting and its application to NLC graph grammars
+Normal rank
@@ Property / cites work @@
+Q3676177
@@ Property / cites work: Q3676177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Hyperedge replacement: grammars and languages
@@ Property / cites work: Hyperedge replacement: grammars and languages / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of node-label-controlled graph languages
+Normal rank
@@ Property / cites work @@
+Restrictions, extensions, and variations of NLC grammars
+Normal rank
@@ Property / cites work @@
+Graph grammars with neighbourhood-controlled embedding
+Normal rank
@@ Property / cites work @@
+On simple characterizations of k-trees
@@ Property / cites work: On simple characterizations of k-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Dacey Graphs
@@ Property / cites work: Dacey Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank