Approximating clique-width and branch-width

Journal of Combinatorial Theory. Series B

Volumn 96, Issue 4, 2006, Pages 514-528

  Oum, Sang il ^a   Seymour, Paul ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

Branch width; Clique width; Matroid; Rank width; Submodular functions

Indexed keywords

EID: 32544455938     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.10.006     Document Type: Article

References (24)

1. 2 k + 1 ) time (extended abstract). Graph-Theoretic Concepts in Computer Science, Boltenhagen, 2001. Lecture Notes in Comput. Sci. vol. 2204 (2001), Springer, Berlin 229-240
2. Hliněný P. A parametrized algorithm for matroid branch-width. SIAM J. Comput. 35 2 (2005) 259-277
3. Downey R.G., and Fellows M.R. Parameterized Complexity. Monogr. Comput. Sci. (1999), Springer, New York
4. Corneil D.G., and Rotics U. On the relationship between clique-width and tree-width. SIAM J. Comput. 34 4 (2005) 825-847 (electronic)
5. Courcelle B., and Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101 1-3 (2000) 77-114
6. Espelage W., Gurski F., and Wanke E. Deciding clique-width for graphs of bounded tree-width. J. Graph Algorithms Appl. 7 2 (2003) 141-180
7. n, n. Graph-Theoretic Concepts in Computer Science, Konstanz, 2000. Lecture Notes in Comput. Sci. vol. 1928 (2000), Springer, Berlin 196-205
8. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic. Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1 (1997), World Scientific, River Edge, NJ 313-400
9. Robertson N., and Seymour P. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 63 1 (1995) 65-110
10. Wanke E. k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54 2-3 (1994) 251-266
11. Kobler D., and Rotics U. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126 2-3 (2003) 197-221
12. Espelage W., Gurski F., and Wanke E. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. Graph-Theoretic Concepts in Computer Science, Boltenhagen, 2001. Lecture Notes in Comput. Sci. vol. 2204 (2001), Springer, Berlin 117-128
13. Courcelle B., Makowsky J.A., and Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33 2 (2000) 125-150
14. Robertson N., and Seymour P. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 2 (1991) 153-190
15. Oxley J.G. Matroid Theory (1992), Oxford Univ. Press, New York
16. Corneil D.G., Perl Y., and Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14 4 (1985) 926-934
17. Corneil D.G., Habib M., Lanlignel J.-M., Reed B., and Rotics U. Polynomial time recognition of clique-width {less-than or slanted equal to}3 graphs (extended abstract). In: Gonnet G.H., et al. (Ed). LATIN 2000: Theoretical Informatics. 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000. Lecture Notes in Comput. Sci. vol. 1776 (2000), Springer, Berlin 126-134
18. Reed B.A. Tree width and tangles: A new connectivity measure and some applications. Surveys in Combinatorics, 1997, London. London Math. Soc. Lecture Note Ser. vol. 241 (1997), Cambridge Univ. Press, Cambridge 87-162
19. Iwata S., Fleischer L., and Fujishige S. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48 4 (2001) 761-777
20. Murota K. Matrices and Matroids for Systems Analysis. Algorithms Combin. vol. 20 (2000), Springer, Berlin
21. Truemper K. Matroid Decomposition (1992), Academic Press, Boston, MA
22. Truemper K. A decomposition theory for matroids. I. General results. J. Combin. Theory Ser. B 39 1 (1985) 43-76
23. Schrijver A. Combinatorial Optimization. Polyhedra and Efficiency, vol. B. Algorithms Combin. vol. 24 (2003), Springer, Berlin
24. Cunningham W.H. Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15 4 (1986) 948-957