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 consider a slightly more general concept of a class of structures having bounded local tree-width.We show that for each property φ of structures that is definable in first-order logic and for each locally tree-decomposable class C of structures, there is a linear time algorithm deciding whether a given structure A ∈ C has property φ. For classes C of bounded local tree-width, we show that for every k ≥ 1 there is an algorithm solving the same problem in time O(n1+(1/k)) (where n is the cardinality of the input structure).

[1]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[2]  Frank Harary,et al.  Graph Theory , 2016 .

[3]  Rolf Niedermeier,et al.  Parameterized complexity: exponential speed-up for planar graph problems , 2001, J. Algorithms.

[4]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[5]  Michael R. Fellows,et al.  The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1] , 1996, DMTCS.

[6]  Jörg Flum,et al.  Fixed-Parameter Tractability, Definability, and Model-Checking , 1999, SIAM J. Comput..

[7]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[8]  A. Leaf.  GRAPH THEORY AND PROBABILITY , 1957 .

[9]  Mihalis Yannakakis.  Perspectives on database theory , 1996, SIGA.

[10]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[11]  Neil Immerman.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[12]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[13]  P. Boas.  Machine models and simulations , 1991 .

[14]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[15]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[16]  Mihalis Yannakakis,et al.  On the complexity of database queries (extended abstract) , 1997, PODS.

[17]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[18]  Martin Grohe,et al.  Fixed-parameter tractability and logic , 1999 .

[19]  David Peleg,et al.  Distance-Dependent Distributed Directories , 1993, Inf. Comput..

[20]  Peter van Emde Boas,et al.  Machine Models and Simulation , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[21]  Ronald L. Rivest,et al.  The Design and Analysis of Computer Algorithms , 1990 .

[22]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[23]  Saharon Shelah,et al.  Distorted sums of models , 1996 .

[24]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[25]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[26]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[27]  Lenore Cowen,et al.  Near-linear cost sequential and distributed constructions of sparse neighborhood covers , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[28]  Bruce A. Reed,et al.  Finding approximate separators and computing tree width quickly , 1992, STOC '92.

[29]  Carsten Thomassen,et al.  Embeddings and minors , 1996 .

[30]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[31]  Jörg Flum,et al.  Query evaluation via tree-decompositions , 2001, JACM.

[32]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[33]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[34]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[35]  Martin Grohe.  Local Tree-Width, Excluded Minors, and Approximation Algorithms , 2003, Comb..

[36]  Detlef Seese,et al.  Linear time computable problems and first-order descriptions , 1996, Mathematical Structures in Computer Science.

[37]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[38]  Martin Grohe,et al.  An Existential Locality Theorem , 2001, CSL.

[39]  Mihalis Yannakakis,et al.  On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..

[40]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..