Finding branch-decompositions and rank-decompositions

SIAM Journal on Computing

Volumn 38, Issue 3, 2008, Pages 1012-1032

  Hliněný, Petr ^a   Oum, Sang Il ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Branch width; Clique width; Fixed parameter tractable algorithm; Graph; Matroid; Rank width

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATRIX ALGEBRA;

BRANCH-WIDTH; CLIQUE-WIDTH; FIXED-PARAMETER TRACTABLE ALGORITHM; GRAPH; MATROID; RANK-WIDTH;

DECOMPOSITION;

EID: 55249112968     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070685920     Document Type: Article

References (24)

1. D. G. CORNEIL, M. HABIB, J.-M. LANLIGNEL, B. A. REED, AND U. ROTICS, Polynomial time recognition of clique-width ≤ 3 graphs (extended abstract), in LATIN 2000: Theoretical informatics, G. H. Gonnet, D. Panario, and A. Viola, eds., Lecture Notes in Comput. Sci. 1776, Springer, Berlin, 2000, pp. 126-134.
2. D. G. CORNEIL, Y. PERL, AND L. K. STEWART, A linear recognition algorithm for cographs, SIAM J. Comput., 14 (1985), pp. 926-934.
3. B. COURCELLE, J. A. MAKOWSKY, AND U. ROTICS, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst., 33 (2000), pp. 125-150.
4. B. COURCELLE AND S. OLARIU, Upper bounds to the clique, width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
5. B. COURCELLE AND S. OUM, Vertex-minors, monadic second-order logic, and a conjecture by Seese, J. Combin. Theory Ser. B, 97 (2007), pp. 91-126.
6. W. ESPELAGE, P. GURSKI, AND E. WANKE, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time, in Graph-Theoretic Concepts in Computer Science (Boltenhagen, 2001), Lecture Notes in Comput. Sci. 2204, Springer, Berlin, 2001, pp. 117-128.
7. M. R. FELLOWS, F. A. ROSAMOND, U. ROTICS, AND S. SZEIDER, Clique-width minimization is NP-hard, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2006, pp. 354-362.
8. J. F. GEELEN, A. M. H. GERARDS. N. ROBERTSON, AND G. P. WHITTLE, On the excluded minors for the matroids of branch-width κ, J. Combin. Theory Ser. B, 88 (2003), pp. 261-265.
9. J. F. GEELEN, A. M. H. GERARDS, AND G. WHITTLE, Tangles, Tree-Decompositions, and Grids in Matroids, Research report 04-5, School of Mathematical and Computing Sciences, Victoria University of Wellington, Wellington, New Zealand, 2004.
10. M. U. GERBER AND D. KOBLER, Algorithms for vertex-partitioning problems on graphs with fixed clique-width, Theoret. Comput. Sci., 299 (2003), pp. 719-734.
11. I. V. HICKS AND N. B. MCMURRAY, JR., The branchwidth of graphs and their cycle matroids. J. Combin. Theory Ser. B, 97 (2007), pp. 681-692.
12. J. W. P. HIRSCHFELD AND L. STORME, The packing problem in statistics, coding theory and finite projective spaces: Update 2001, in Finite Geometries, Dev. Math. 3, Kluwer Academic Publishers, Dordrecht, 2001, pp. 201-246.
13. P. HLINĚNÝ, A parametrized algorithm for matroid branch-width, SIAM J. Comput., 35 (2005), pp. 259-277.
14. P. HLINĚNÝ, Branch-width, parse trees, and monadic second-order logic for matroids, J. Combin. Theory Ser. B, 96 (2006), pp. 325-351.
15. D. KOBLER AND U. ROTICS, Edge dominating set and colorings on graphs with fixed clique-width, Discrete Appl. Math., 126 (2003), pp. 197-221.
16. F. MAZOIT AND S. THOMASSÉ, Branchwidth of graphic matroids, in Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 346, Cambridge University Press, Cambridge, 2007, pp. 275-286.
17. S. OUM, Rank-width and vertex-minors, J. Combin. Theory Ser. B, 95 (2005), pp. 79-100.
18. S. OUM, Approximating rank-width and clique-width quickly, submitted, 2006.
19. S. OUM AND P. SEYMOUR, Approximating clique-width and branch-width, J. Combin. Theory Ser. B, 96 (2006), pp. 514-528.
20. S. OUM AND P. SEYMOUR, Testing branch-width, J. Combin. Theory Ser. B, 97 (2007), pp. 385-393.
21. J. G. OXLEY, Matroid Theory, Oxford University Press, New York, 1992.
22. N. ROBERTSON AND P. SEYMOUR, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), pp. 153-190.
23. P. SEYMOUR AND R. THOMAS, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217-241.
24. F. WANKE, κ-NLC graphs and polynomial algorithms. Efficient algorithms and partial κ-trees, Discrete Appl. Math., 54 (1994), pp. 251-266.