Tree-width and the monadic quantifier hierarchy. (Q1401360): Difference between revisions

@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Defining a Relation on a Finite Graph
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / 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 @@
+Q4508369
@@ Property / cites work: Q4508369 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Handbook of Graph Grammars and Computing by Graph Transformation
+Normal rank
@@ Property / cites work @@
+Q4852905
@@ Property / cites work: Q4852905 / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Second-order and Inductive Definability on Finite Structures
+Normal rank
@@ Property / cites work @@
+Tree acceptors and some of their applications
@@ Property / cites work: Tree acceptors and some of their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic generalized spectra
@@ Property / cites work: Monadic generalized spectra / rank @@
+Normal rank
@@ Property / cites work @@
+On monadic NP vs monadic co-NP
@@ Property / cites work: On monadic NP vs monadic co-NP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4128417
@@ Property / cites work: Q4128417 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+When is the evaluation of conjunctive queries tractable?
+Normal rank
@@ Property / cites work @@
+Q2766682
@@ Property / cites work: Q2766682 / 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 @@
+Arity and alternation in second-order logic
@@ Property / cites work: Arity and alternation in second-order logic / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+Q4218948
@@ Property / cites work: Q4218948 / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of the models of decidable monadic theories of graphs
+Normal rank
@@ Property / cites work @@
+Q3048241
@@ Property / cites work: Q3048241 / rank @@
+Normal rank
@@ Property / cites work @@
+Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized finite automata theory with an application to a decision problem of second-order logic
+Normal rank