Finding branch-decompositions and rank-decompositions

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

Volumn 4698 LNCS, Issue , 2007, Pages 163-174

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

^a MASARYK UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

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

Indexed keywords

ALGORITHMS; GRAPH THEORY; PARAMETER ESTIMATION;

CLIQUE WIDTH; FIXED PARAMETER TRACTABLE ALGORITHM; RANK WIDTH;

MATRIX ALGEBRA;

EID: 38049011945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_16     Document Type: Conference Paper

References (24)

1. Corneil, D.G., Habib, M., Lanlignel, J.M., Reed, B., Rotics, U.: Polynomial time recognition of clique-width < 3 graphs (extended abstract). In: Gonnet, G.H., et al. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 126-134. Springer, Heidelberg (2000)
2. Corneil, D.G., Perl, Y., Stewart, L.K: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926-934 (1985)
3. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125-150 (2000)
4. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1-3), 77-114 (2000)
5. Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Combin. Theory Ser. B 97(1), 91-126 (2007)
6. Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, Springer, Heidelberg (2001)
7. Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width minimization is NP-hard. In: Proceedings of the 38th annual ACM Symposium on Theory of Computing, pp. 354-362. ACM Press, New York, USA (2006)
8. Geelen, J.F., Gerards, A.M.H., Robertson, N., Whittle, G.: On the excluded minors for the matroids of branch-width k. J. Combin. Theory Ser. B 88(2), 261-265 (2003)
9. Geelen, J.F., Gerards, A.M.H., Whittle, G.: Tangles, tree-decompositions, and grids in matroids. Research Report 04-5, School of Mathematical and Computing Sciences, Victoria University of Wellington (2004)
10. Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci. 299(1-3), 719-734 (2003)
11. Hicks, I.V., McMurray, Jr., N.B.: The branchwidth of graphs and their cycle matroids. J. Combin. Theory Ser. B, 97(5), 681-692, (2007)
12. Hliněný, P.: A parametrized algorithm for matroid branch-width (loose erratum (electronic)). SIAM J. Comput. 35(2), 259-277 (2005)
13. Hliněný, P.: Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B 96(3), 325-351 (2006)
14. Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126(2-3), 197-221 (2003)
15. Mazoit, F., Thomassé, S.: Branchwidth of graphic matroids. Manuscript (2005)
16. Oum, S.: Approximating rank-width and clique-width quickly. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 49-58. Springer, Heidelberg (2005)
17. Oum, S.: Rank-width and vertex-minors. J. Combin. Theory Ser. B 95(1), 79-100 (2005)
18. Oum, S.: Approximating rank-width and clique-width quickly. Submitted, an extended abstract appeared in [16] (2006)
19. Oum, S., Seymour, P.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96(4), 514-528 (2006)
20. Oum, S., Seymour, P.: Testing branch-width. J. Combin. Theory Ser. B 97(3), 385-393 (2007)
21. Oxley, J.G.: Matroid theory. Oxford University Press, New York (1992)
22. Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52(2), 153-190 (1991)
23. Seymour, P., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217-241 (1994)
24. Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54(2-3), 251-266 (1994)