A parametrized algorithm for matroid branch-width

SIAM Journal on Computing

Volumn 35, Issue 2, 2006, Pages 259-277

  Hliněný, Petr ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

Branch width; Parametrized algorithm; Rank width; Representable matroid

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; GRAPH THEORY;

BRANCH-WIDTH; PARAMETRIZED ALGORITHM; RANK-WIDTH; REPRESENTABLE MATROID;

MATRIX ALGEBRA;

EID: 32144446394     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702418589     Document Type: Article

References (22)

1. K. A. ABRAHAMSON AND M. R. FELLOWS, Finite automata, bounded treewidth, and well-quasiordering, in Graph Structure Theory, Contemp. Math. 147, AMS, Providence, RI, 1993, pp. 539-564.
2. S. ARNBORG, J. LAGERGREN, AND D. SEESE, Easy problems for tree-decomposable graphs, J. Algorithms, 12 (1991), pp. 308-340.
3. H. L. BODLAENDER, A tourist guide through treewidth, Acta Cybernet., 11 (1993), pp. 1-21.
4. H. L. BODLAENDER, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.
5. H. L. BODLAENDER AND D. M. THILIKOS, Constructive linear time algorithms for branchwidth, in Proceedings of the 24th ICALP, Lecture Notes in Comput. Sci. 1256, Springer, Berlin, 1997, pp. 627-637.
6. B. COURCELLE, On context-free sets of graphs and their monadic second-order theory, in Graph-Grammars and Their Application to Computer Science, Lecture Notes in Comput. Sci. 291, Springer, Berlin, 1987, pp. 133-146.
7. B. COURCELLE, The monadic second-order logic of graphs I. Recognizable sets of finite graphs, Inform. Comput., 85 (1990), pp. 12-75.
8. R. DIESTEL, Graph Theory, 2nd ed., Graduate Texts in Math. 173, Springer-Verlag, New York, 2000.
9. R. G. DOWNEY AND M. R. FELLOWS, Parametrized Complexity, Springer-Verlag, New York, 1999.
10. J. F. GEELEN, A. H. M. GERARDS, AND G. P. WHITTLE, Branch-width and well-quasi-ordering in matroids and graphs, J. Combin. Theory Ser. B, 84 (2002), pp. 270-290.
11. J. F. GEELEN, A. H. M. GERARDS, N. ROBERTSON, AND G. P. WHITTLE, On the excluded minors for the matroids of branch-width k, J. Combin. Theory Ser. B, 88 (2003), pp. 261-265.
12. P. HLINĚNÝ, On the excluded minors for matroids of branch-width three, Electron. J. Combin., 9 (2002), Research paper 32. Available online at http://www.combinatorics.org.
13. P. HLINĚNÝ, The Tutte polynomial for matroids of bounded branch-width, Combin. Probab. Comput., to appear.
14. P. HLINĚNÝ, Branch-width, parse trees, and monadic second-order logic for matroids, J. Combin. Theory Ser. B, submitted.
15. P. HLINĚNÝ, On matroid properties definable in the MSO logic, in Proceedings of the Mathematical Foundations of Computer Science (MFCS 2003), Lecture Notes in Comput. Sci. 2747, Springer-Verlag, Berlin, 2003, pp. 470-479.
16. P. HLINĚNÝ AND G. P. WHITTLE, Matroid tree-width, European J. Combin., submitted.
17. P. HLINĚNÝ AND D. SEESE, Trees, grids, and MSO decidability: From graphs to matroids, Theoret. Comput. Sci., to appear.
18. SANG-IL OUM AND P. D. SEYMOUR, Approximating clique-width and branch-width, submitted.
19. SANG-IL OUM, Approximating rank-width and clique-width quickly, in Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, Springer-Verlag, Heidelberg, to appear.
20. J. G. OXLEY, Matroid Theory, Oxford University Press, Oxford, UK, 1992.
21. N. ROBERTSON AND P. D. SEYMOUR, Graph minors - A survey, in Surveys in Combinatorics, Cambridge University Press, Cambridge, UK, 1985, pp. 153-171.
22. N. ROBERTSON AND P. D. SEYMOUR, Graph minors x. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), pp. 153-190.