Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Easy problems for tree-decomposable graphs
Journal of Algorithms
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Combinatorial Computations: An Introduction
GI - 8. Jahrestagung
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Approximation algorithms for NP-complete problems on planar graphs
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Parameterized Complexity
Parameterized complexity for the database theorist
ACM SIGMOD Record
Weighted counting of k-matchings is #w[1]-hard
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 0.00 |
It has been proved in [12] that properties of graphs or other relational structures that are definable in first-order logic can be decided in linear time when the input structures are restricted to come from a locally tree-decomposable class of structures. Examples of such classes are the class of planar graphs or classes of graphs of bounded degree.In this paper, we consider more general computational problems than decision problems. We prove that construction, listing, and counting problems definable in first-order logic can be solved in linear time on locally tree-decomposable classes of structures.