Easy problems for tree-decomposable graphs
Journal of Algorithms
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Perspectives on database theory
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Parameterized Complexity
Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Generalized Model-Checking over Locally Tree-Decomposable Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
An Existential Locality Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
We introduce the concept of a class of graphs 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 show that for each locally tree-decomposable class C of graphs and for each property ϕ of graphs that is definable in first-order logic, there is a linear time algorithm deciding whether a given graph G ∈ C has property ϕ