Degree Year
2020
Document Type
Thesis - Open Access
Degree Name
Bachelor of Arts
Department
Computer Science
Advisor(s)
Robert Geitz
Keywords
Courcelle, Monadic, Logic, Graph theory, Parameterized, Complexity, Treewidth
Abstract
Courcelle's Theorem states that any graph property expressible in monadic second order logic can be decidedin O(f(k)n) for graphs of treewidth k. This paper gives a broad overview of how this theorem is proved and outlines tools available to help express graph properties in monadic second order logic.
Repository Citation
Barr, Samuel Frederic, "Courcelle's Theorem: Overview and Applications" (2020). Honors Papers. 679.
https://digitalcommons.oberlin.edu/honors/679
