Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover

@article{Lampis2009AlgorithmicMF,
  title={Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover},
  author={Michael Lampis},
  journal={CoRR},
  year={2009},
  volume={abs/0910.0582}
}
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 treewidth. Unfortunately, the running time’s dependence on the MSO formula describing the problem is in general a tower of exponentials of unbounded height, and there exist lower… CONTINUE READING