I am looking for an easy and introductory paper on the proof of Courcelle's Theorem. I am also interested in its connection to parameterized complexity regarding the treewidth.
I am only a beginner in this field.
Any suggestions?
Asked By : Laura
Answered By : Juho
There's a soft introduction in Rolf Niedermeier's book Invitation to Fixed Parameter Algorithms. Daniel Marx also has quite a few slides available on his homepage that contain short examples of modeling a problem in MSOL. One set of relevant slides is here. For more links, see a related question on CSTheory.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/16324
0 comments:
Post a Comment
Let us know your responses and feedback