Deciding first-order properties of locally tree-decomposable structures.
We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of planar graphs and all classes of bounded valence or of bounded tree-width. We also consi...
| Published in: | Journal of the ACM 48, 6 (2001). |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Subjects: |