Branch-width, parse trees, and monadic second-order logic for matroids (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 319-330

  Hliněný, Petr ^a,b  

^a MATEJ BEL UNIVERSITY   (Slovakia)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Branch width; Fixed parameter complexity; Monadic second order logic; Representable matroid

Indexed keywords

COMPUTER PROGRAMMING; FORESTRY; FORMAL LOGIC; GRAPH THEORY; TREES (MATHEMATICS);

ALGORITHMIC APPLICATIONS; AMOUNT OF INFORMATION; BRANCH-WIDTH; FINITE TREE AUTOMATON; FIXED-PARAMETER COMPLEXITY; MONADIC LOGIC; MONADIC SECOND-ORDER LOGIC; SECOND ORDERS;

COMBINATORIAL MATHEMATICS;

EID: 34247234501     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_29     Document Type: Article

References (20)

1. K.A. Abrahamson, M.R. Fellows, Finite Automata, Bounded Treewidth, and Well-Quasiordering, In: Graph Structure Theory, Contemporary Mathematics 147, American Mathematical Society (1993), 539-564.
2. S. Arnborg, J. Lagergren, D. Seese, Problems easy for Tree-decomposible Graphs (extended abstract), Proc. 15th Colloq. Automata, Languages and Programming, Lecture Notes in Computer Science 317, Springer-Verlag (1988), 38-51.
3. H.L. Bodlaender, A Tourist Guide through Treewidth, Acta Cybernetica 11 (1993), 1-21.
4. R.B. Borie, R.G. Parker, C.A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica 7 (1992), 555-582.
5. B. Courcelle, Recognizability and Second-Order Definability for Sets of Finite Graphs, technical report I-8634, Universite de Bordeaux, 1987.
6. B. Courcelle, Graph Rewriting: an Algebraic and Logic Approach, In: Handbook of Theoretical Computer Science Vol. B, Chap. 5, North-Holland 1990.
7. B. Courcelle, The Monadic Second-Order Logic of Graphs I. Recognizable sets of Finite Graphs Information and Computation 85 (1990), 12-75.
8. R. Diestel, Graph theory, Graduate Texts in Mathematics 173, Springer-Verlag, New York 1997, 2000.
9. R.G. Downey, M.R. Fellows, Parametrized Complexity, Springer-Verlag New York, 1999, ISBN 0-387-94833-X.
10. J.F. Geelen, A.H.M. Gerards, N. Robertson, G.P. Whittle, On the Excluded Minors for the Matroids of Branch-Width k, manuscript, 2002.
11. J.F. Geelen, A.H.M. Gerards, G.P. Whittle, Branch-Width and Well-Quasi-Ordering in Matroids and Graphs, J. Combin. Theory Ser. B 84 (2002), 270-290.
12. P. Hliněný, The Tutte Polynomial for Matroids of Bounded Branch-Width, submitted, 2002.
13. P. Hliněný, It is Hard to Recognize Free Spikes, submitted, 2002.
14. P. Hliněný, Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids, submitted, 2002.
15. P. Hliněný, A Parametrized Algorithm for Matroid Branch-Width, submitted, 2002.
16. P. Hliněný, Branch-Width and Parametrized Algorithms for Representable Matroids, in preparation, 2002.
17. J. Hopcroft, J. Ullmann, Introduction to Automata Theory, Adisson-Wesley 1979.
18. J.G. Oxley, Matroid Theory, Oxford University Press, 1992,1997, ISBN 0-19-853563-5.
19. N. Robertson, P.D. Seymour, Graph Minors - A Survey, Surveys in Combinatorics, Cambridge Univ. Press 1985, 153-171.
20. N. Robertson, P.D. Seymour, Graph Minors X. Obstructions to Tree-Decomposition, J. Combin. Theory Ser. B 52 (1991), 153-190.