Courcelle's theorem -- a game-theoretic approach
From MaRDI portal
(Redirected from Publication:408375)
Recommendations
- A Practical Approach to Courcelle's Theorem
- Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract)
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Evaluation of an MSO-Solver
- Monadic Datalog over finite structures of bounded treewidth
Cites work
- scientific article; zbMATH DE number 2086260 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 475614 (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 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 6783432 (Why is no real title available?)
- scientific article; zbMATH DE number 3399180 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- A technique of state space search based on unfolding
- Algorithmic uses of the Feferman-Vaught theorem
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Back and forth between logic and games
- Complexity of Finding Embeddings in a k-Tree
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- 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 Structure and Monadic Second-Order Logic: Language Theoretical Aspects
- Graph minors. II. Algorithmic aspects of tree-width
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graph theory
- Linear time solvable optimization problems on graphs of bounded clique-width
- Logic, graphs, and algorithms
- Modest theory of short chains. I
- Monadic Datalog over finite structures of bounded treewidth
- Monadic second-order evaluations on tree-decomposable graphs
- Necessary edges in \(k\)-chordalisations of graphs
- New algorithm for weak monadic second-order logic on inductive structures
- On converting CNF to DNF
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- On the model-checking of monadic second-order formulas with edge set quantifications
- Parametrized complexity theory.
- Query evaluation via tree-decompositions
- Special tree-width and the verification of monadic second-order graph properties
- 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
- Tree acceptors and some of their applications
- Treewidth computations. I: Upper bounds
- Treewidth computations. II. Lower bounds
Cited in
(21)- A uniform Tauberian theorem in dynamic games
- Confronting intractability via parameters
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
- Declarative dynamic programming as an alternative realization of Courcelle's theorem
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties
- Implementing Courcelle's theorem in a declarative framework for dynamic programming
- A Characterization of Game-Theoretic Solutions which Lead to Impossibility Theorems
- Computations by fly-automata beyond monadic second-order logic
- Digraph width measures in parameterized algorithmics
- Courcelle's theorem for triangulations
- Practical access to dynamic programming on tree decompositions
- Practical access to dynamic programming on tree decompositions
- scientific article; zbMATH DE number 3188106 (Why is no real title available?)
- Graph minors and parameterized algorithm design
- Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract)
- Extension complexity, MSO logic, and treewidth
- Fixed-parameter tractability of treewidth and pathwidth
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Efficient problem solving on tree decompositions using binary decision diagrams
- The Cournot-Theocharis problem reconsidered
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
This page was built for publication: Courcelle's theorem -- a game-theoretic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408375)
