Problems Easy for Tree-Decomposable Graphs (Extended Abstract)

Using a variation of the interpretability concept we show that all graph properties definable in monadic second order logic (MS properties) with quantification over vertex and edge sets can be decided in linear time for classes of graphs of fixed bounded tree-width, giving an alternative proof of a recent result by Courcelle. We allow graphs with directed and/or undirected edges, labeled on edges and/or vertices with labels taken from a finite set. We extend MS properties to Extended Monadic Second-order (EMS) problems involving counting or summing evaluations given with the graph over sets definable in monadic second order logic. Our tecnique allowes us to solve also some EMS problems in linear time or in polynomial or pseudopolynomial time for classes of graphs of fixed bounded tree-width. Most problems for wich linear time algorithms for graphs of bounded tree width where previously known to exist, and many others, are EMS problems.

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

[2]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.

[3]  Neil Immerman.  Languages which capture complexity classes , 1983, STOC '83.

[4]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[5]  Detlef Seese,et al.  Tree-partite graphs and the complexity of algorithms , 1985, FCT.

[6]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[7]  S. Arnborg.  Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation , 1978, IEEE Transactions on Reliability.

[8]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[9]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[10]  H. Keisler,et al.  Handbook of mathematical logic , 1977 .

[11]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[12]  A. Rosenthal.  Computing the Reliability of Complex Networks , 1977 .

[13]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[14]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[15]  S. Arnborg,et al.  Characterization and recognition of partial 3-trees , 1986 .

[16]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[17]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[18]  H. Bodlaender.  Classes of graphs with bounded tree-width , 1986 .