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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

An introduction to algebras for graphs, based on Courcelle's algebras of hyperedge replacement and vertex replacement. The paper…

2018

For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two…

2017

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic…

2016

. Many computationally hard problems become tractable if the graph structure underlying the problem instance exhibits small…

2014

We present an almost complete classification of the parameterized complexity of all operator fragments of the satisfiability…

2014

We present a complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in…

2011

We present an alternative proof of a theorem by Courcelle, Makowski and Rotics which states that problems expressible in MSO are…

2004

Recognizable sets of unranked, unordered trees have been introduced in Courcelle [C89] in a Myhill-Nerode [N58] style of inverse…

1995

1995