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]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[2]  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.

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

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

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

[6]  Jens Lagergren,et al.  The Nonexistence of Reduction Rules Giving an Embedding into a K-tree , 1994, Discret. Appl. Math..

[7]  RobertsonNeil,et al.  Graph minors. XIII , 1994 .

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

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

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

[11]  Bruno Courcelle,et al.  Graphs as Relational Structures: An Algebraic an Logical Approach , 1990, Graph-Grammars and Their Application to Computer Science.

[12]  Jeffrey D. Ullman,et al.  Flow graph reducibility , 1972, SIAM J. Comput..

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

[14]  J. Lagergren.  Efficient parallel algorithms for tree-decomposition and related problems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

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

[17]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

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

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

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

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

[22]  Bruno Courcelle,et al.  The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..

[23]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

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

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

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

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

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

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

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

[31]  Hans L. Bodlaender.  Improved Self-reduction Algorithms for Graphs with Bounded Treewidth , 1994, Discret. Appl. Math..

[32]  Ton Kloks,et al.  Better Algorithms for the Pathwidth and Treewidth of Graphs , 1991, ICALP.