13 citations · 46 across the 31 of their papers we have counts for
1 paper · 2 filters
Michael Lampis
Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for graphs of bounded…