A Practical Approach to Courcelle's Theorem
From MaRDI portal
Recommendations
- An application of a theorem of Deuring and Šafarevič
- scientific article; zbMATH DE number 1000073
- scientific article; zbMATH DE number 3879519
- An approach to a Ricceri's conjecture
- An application of a theorem of Rothmaler
- A refinement of Kuratowski's theorem
- scientific article; zbMATH DE number 1303437
- scientific article; zbMATH DE number 5887580
- scientific article; zbMATH DE number 4077664
- A further application of the deLeeuw-Glickstein theorem
Cites work
- Algorithmic uses of the Feferman-Vaught theorem
- An application of games to the completeness problem for formalized theories
- Application of model theoretic games to discrete linear orders and finite automata
- Computing crossing numbers in quadratic time
- Decision Problems of Finite Automata Design and Related Arithmetics
- Easy instances for model checking
- Easy problems for tree-decomposable graphs
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 3115890 (Why is no real title available?)
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 3906520 (Why is no real title available?)
- scientific article; zbMATH DE number 3510287 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1773084 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Logic, graphs, and algorithms
- Monadic second-order evaluations on tree-decomposable graphs
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Parametrized complexity theory.
- Query evaluation via tree-decompositions
- The complexity of first-order and monadic second-order logic revisited
- The first order properties of products of algebraic systems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(19)- Practical access to dynamic programming on tree decompositions
- Structural parameterizations of Tracking Paths problem
- Parameterized analysis and crossing minimization problems
- Declarative dynamic programming as an alternative realization of Courcelle's theorem
- Graph minors and parameterized algorithm design
- Monadic Datalog over finite structures of bounded treewidth
- A Note on the Minimum H-Subgraph Edge Deletion
- Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract)
- Implementing Courcelle's theorem in a declarative framework for dynamic programming
- Easy problems for tree-decomposable graphs
- Courcelle's theorem for triangulations
- Courcelle's theorem -- a game-theoretic approach
- Confronting intractability via parameters
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- Practical access to dynamic programming on tree decompositions
- Default logic and bounded treewidth
- Lifted inference with tree axioms
- Enumeration of minimal hitting sets parameterized by treewidth
This page was built for publication: A Practical Approach to Courcelle's Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170276)
