Abstract
One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time for graphs of bounded treewidth, which is known as Courcelle's Theorem [6]. These algorithms are constructed as finite state tree automata, and hence every CMSOL-definable graph property is recognizable. Courcelle also conjectured that the converse holds, i.e. every recognizable graph property is definable in CMSOL for graphs of bounded treewidth. We prove this conjecture for κ-outerplanar graphs, which are known to have treewidth at most 3κ - 1 [2].
| Original language | English |
|---|---|
| Title of host publication | 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, 16-18 September 2015, Patras, Greece |
| Place of Publication | s.l. |
| Publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
| Pages | 176-186 |
| Number of pages | 11 |
| ISBN (Electronic) | 9783939897927 |
| DOIs | |
| Publication status | Published - 1 Nov 2015 |
| Event | 10th International Symposium on Parameterized and Exact Computation, IPEC 2015 - Patras, Greece Duration: 16 Sept 2015 → 18 Sept 2015 Conference number: 10 http://algo2015.upatras.gr/ipec |
Conference
| Conference | 10th International Symposium on Parameterized and Exact Computation, IPEC 2015 |
|---|---|
| Abbreviated title | IPEC 2015 |
| Country/Territory | Greece |
| City | Patras |
| Period | 16/09/15 → 18/09/15 |
| Internet address |
Keywords
- Finite state tree automata
- Monadic second order logic of graphs
- Treewidth
- κ-outerplanar graphs