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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query evaluation via tree-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first order properties of products of algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modest theory of short chains. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog over finite structures of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5666510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3172530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On converting CNF to DNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the model-checking of monadic second-order formulas with edge set quantifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique of state space search based on unfolding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. II. Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary edges in \(k\)-chordalisations of graphs / rank
 
Normal rank

Revision as of 01:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Courcelle's theorem -- a game-theoretic approach
scientific article

    Statements

    Courcelle's theorem -- a game-theoretic approach (English)
    0 references
    0 references
    0 references
    0 references
    5 April 2012
    0 references
    parameterized algorithms
    0 references
    model checking
    0 references
    monadic second-order logic
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers