Monadic second-order evaluations on tree-decomposable graphs (Q685464): Difference between revisions

@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Q4037299
@@ Property / cites work: Q4037299 / 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 @@
+Graph expressions and graph rewritings
@@ Property / cites work: Graph expressions and graph rewritings / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time computation of optimal subgraphs of decomposable graphs
+Normal rank
@@ Property / cites work @@
+Q4734761
@@ Property / cites work: Q4734761 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of path-forming games
@@ Property / cites work: Complexity of path-forming games / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+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 @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
+Normal rank
@@ Property / cites work @@
+Attribute grammars. Definitions, systems and bibliography
+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 @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
+Normal rank
@@ Property / cites work @@
+Linear-time computability of combinatorial problems on series-parallel graphs
+Normal rank
@@ Property / cites work @@
+Generalized finite automata theory with an application to a decision problem of second-order logic
+Normal rank
@@ Property / cites work @@
+The Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3822197
@@ Property / cites work: Q3822197 / rank @@
+Normal rank