Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families

This paper describes a predicate calculus in which graph problems can be expressed. Any problem possessing such an expression can be solved in linear time on any recursively constructed graph, once its decomposition tree is known. Moreover, the linear-time algorithm can be generatedautomatically from the expression, because all our theorems are proved constructively. The calculus is founded upon a short list of particularly primitive predicates, which in turn are combined by fundamental logical operations. This framework is rich enough to include the vast majority of known linear-time solvable problems.We have obtained these results independently of similar results by Courcelle [11], [12], through utilization of the framework of Bernet al. [6]. We believe our formalism is more practical for programmers who would implement the automatic generation machinery, and more readily understood by many theorists.

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

[2]  Thomas J. Schaefer,et al.  On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

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

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

[5]  Detlef Seese,et al.  Problems Easy for Tree-Decomposable Graphs (Extended Abstract) , 1988, ICALP.

[6]  Hans L. Bodlaender,et al.  Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees , 1988, J. Algorithms.

[7]  Detlef Seese,et al.  A combinatorial and logical approach to linear-time computability , 1987, EUROCAL.

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

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

[10]  ArnborgStefan.  Efficient algorithms for combinatorial problems on graphs with bounded, decomposabilitya survey , 1985 .

[11]  Stefan Arnborg,et al.  Problems Easy for Tree-Decomposable Graphs (Extended Abstract) , 1988, ICALP.

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

[13]  Stephen T. Hedetniemi,et al.  Linear algorithms on k-terminal graphs , 1987 .

[14]  H. Bodlaender.  Planar graphs with bounded treewidth , 1988 .

[15]  Maciej M. SysŁ.  The subgraph isomorphism problem for outerplanar graphs , 1982 .

[16]  Bruno Courcelle,et al.  Graph expressions and graph rewritings , 1987, Mathematical systems theory.

[17]  M. B. Richey,et al.  Combinatorial optimization on series-parallel graphs: algorithms and complexity , 1985 .

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

[19]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[20]  Hans L. Bodlaender,et al.  NC-Algorithms for Graphs with Small Treewidth , 1988, WG.