An algebraic theory of graph reduction

We show how membership in classes of graphs definable in monadic second order logic and of bounded treewidth can be decided by finite sets of terminating reduction rules. The method is constructive in the sense that we describe an algorithm which will produce, from a formula in monadic second order logic and an integer k such that the class defined by the formula is of treewidth ≤ k, a set of rewrite rules that reduces any member of the class to one of finitely many graphs, in a number of steps bounded by the size of the graph. This reduction system corresponds to an algorithm that runs in time linear in the size of the graph.

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

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

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[5]  Robin Thomas,et al.  Algorithms Finding Tree-Decompositions of Graphs , 1991, J. Algorithms.

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

[7]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..

[8]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[9]  Yoji Kajitani,et al.  Characterization of partial 3-trees in terms of three structures , 1986, Graphs Comb..

[10]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

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

[12]  Michael R. Fellows,et al.  An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[13]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

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

[15]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs , 1988, WG.

[16]  P. Seymour,et al.  Some New Results on the Well-Quasi-Ordering of Graphs , 1984 .

[17]  Sandra Mitchell Hedetniemi,et al.  Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs , 1979, JACM.

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

[19]  Jeffrey D. Ullman,et al.  Flow Graph Reducibility , 1972, SIAM J. Comput..

[20]  Hans L. Bodlaender,et al.  Improved Self-reduction Algorithms for Graphs with Bounded Treewidth , 1990, Discret. Appl. Math..

[21]  Thomas Lengauer,et al.  Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract) , 1988, ICALP.

[22]  Stefan Arnborg,et al.  Forbidden minors characterization of partial 3-trees , 1990, Discret. Math..

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

[24]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[25]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

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