Courcelle's theorem -- a game-theoretic approach (Q408375): Difference between revisions

@@ Property / DOI @@
-.1016/j.disopt.2011.06.001
@@ Property / DOI: 10.1016/j.disopt.2011.06.001 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+MONA
@@ Property / describes a project that uses: MONA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ComputeTW
@@ Property / describes a project that uses: ComputeTW / rank @@
+Normal rank
@@ 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.1016/j.disopt.2011.06.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2963886128
@@ Property / OpenAlex ID: W2963886128 / 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 complexity of first-order and monadic second-order logic revisited
+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 @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Query evaluation via tree-decompositions
@@ Property / cites work: Query evaluation via tree-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+The first order properties of products of algebraic systems
+Normal rank
@@ Property / cites work @@
+Modest theory of short chains. I
@@ Property / cites work: Modest theory of short chains. I / rank @@
+Normal rank
@@ Property / cites work @@
+Q2735980
@@ Property / cites work: Q2735980 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic uses of the Feferman-Vaught theorem
@@ Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3086928
@@ Property / cites work: Q3086928 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4540967
@@ Property / cites work: Q4540967 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
+Normal rank
@@ Property / cites work @@
+Monadic datalog over finite structures of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q2908834
@@ Property / cites work: Q2908834 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5666510
@@ Property / cites work: Q5666510 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3172530
@@ Property / cites work: Q3172530 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273870
@@ Property / cites work: Q4273870 / rank @@
+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 @@
+Tree acceptors and some of their applications
@@ Property / cites work: Tree acceptors and some of their applications / rank @@
+Normal rank
@@ Property / cites work @@
+New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
+Normal rank
@@ Property / cites work @@
+On converting CNF to DNF
@@ Property / cites work: On converting CNF to DNF / rank @@
+Normal rank
@@ Property / cites work @@
+On the model-checking of monadic second-order formulas with edge set quantifications
+Normal rank
@@ Property / cites work @@
+A technique of state space search based on unfolding
+Normal rank
@@ Property / cites work @@
+Q4255575
@@ Property / cites work: Q4255575 / rank @@
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth computations. I: Upper bounds
@@ Property / cites work: Treewidth computations. I: Upper bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth computations. II. Lower bounds
@@ Property / cites work: Treewidth computations. II. Lower bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q5322945
@@ Property / cites work: Q5322945 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
+Normal rank
@@ Property / cites work @@
+Q5365080
@@ Property / cites work: Q5365080 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044360
@@ Property / cites work: Q3044360 / rank @@
+Normal rank
@@ Property / cites work @@
+Necessary edges in \(k\)-chordalisations of graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.DISOPT.2011.06.001
@@ Property / DOI: 10.1016/J.DISOPT.2011.06.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:408375