Courcelle's theorem

In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2018
024619902018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We propose reductions to quantified Boolean formulas (QBF) as a new approach to showing fixed-parameter linear algorithms for… (More)
  • figure 1
Is this relevant?
2017
2017
In graph theory, Courcelle’s theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order… (More)
Is this relevant?
2017
2017
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
We present an almost complete classification of the parameterized complexity of all operator fragments of the satisfiability… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
We present a complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in… (More)
Is this relevant?
2013
2013
Many computationally hard problems become tractable if the graph structure underlying the problem instance exhibits small… (More)
  • figure 1
Is this relevant?
Review
2011
Review
2011
Courcelle’s Theorem states that every problem definable in Monadic SecondOrder logic can be solved in linear time on structures… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Bodlaender's Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Possibly the most famous algorithmic meta-theorem is Courcelle’s theorem, which states that all MSO-expressible graph properties… (More)
Is this relevant?
2009
2009
In 1990, Courcelle showed that every problem definable in Monadic Second-Order Logic (MSO) can be solved in linear time on graphs… (More)
  • figure 2
  • figure 3
Is this relevant?