Branch-width, parse trees, and monadic second-order logic for matroids

We introduce "matroid parse trees" which, using only a limited amount of information, can build up all matroids of bounded branch-width representable over a finite field. We prove that if M is a family of matroids described by a sentence in the second-order monadic logic of matroids, then the parse trees of bounded-width representable members of M can be recognized by a finite tree automaton. Since the cycle matroids of graphs are representable over any finite field, our result directly extends the well-known "MS2-theorem" for graphs of bounded tree-width by Courcelle and others. This work has algorithmic applications in matroid or coding theories.

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

[2]  Detlef Seese,et al.  The Structure of Models of Decidable Monadic Theories of Graphs , 1991, Ann. Pure Appl. Log..

[3]  Bert Gerards,et al.  On the excluded minors for the matroids of branch-width k , 2003, J. Comb. Theory, Ser. B.

[4]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[5]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[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]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[8]  Craig A. Tovey,et al.  Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families , 1992, Algorithmica.

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

[10]  Bert Gerards,et al.  Branch-Width and Well-Quasi-Ordering in Matroids and Graphs , 2002, J. Comb. Theory, Ser. B.

[11]  Dimitrios M. Thilikos,et al.  Constructive Linear Time Algorithms for Branchwidth , 1997, ICALP.

[12]  P. Seymour,et al.  Surveys in combinatorics 1985: Graph minors – a survey , 1985 .

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

[14]  Petr Hlinený,et al.  On Matroid Properties Definable in the MSO Logic , 2003, MFCS.

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

[16]  Stefan Arnborg,et al.  Algorithm Theory — SWAT'98 , 1998, Lecture Notes in Computer Science.

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

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

[19]  Petr Hlinený,et al.  A Parametrized Algorithm for Matroid Branch-Width , 2005, SIAM J. Comput..

[20]  Bruno Courcelle,et al.  On context-free sets of graphs and their monadic second-order theory , 1986, Graph-Grammars and Their Application to Computer Science.

[21]  Michael R. Fellows,et al.  Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.

[22]  Sang-il Oum,et al.  Approximating rank-width and clique-width quickly , 2005, TALG.