Deciding First-Order Properties of Locally Tree-Decomposable Graphs
- 1 January 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 331-340
- https://doi.org/10.1007/3-540-48523-6_30
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Parameterized ComplexityPublished by Springer Nature ,1999
- On the complexity of database queries (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Graph Rewriting: An Algebraic and Logic ApproachPublished by Elsevier ,1990
- Upper and lower bounds for first order expressibilityJournal of Computer and System Sciences, 1982
- On Local and Non-Local PropertiesPublished by Elsevier ,1982
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976