Approximating rank-width and clique-width quickly

ACM Transactions on Algorithms

Volumn 5, Issue 1, 2008, Pages

  Oum, Sang Il ^a  

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

Author keywords

Approximation algorithms; Branch width; Clique width; Matroids; Rank width

Indexed keywords

BINARY MATROIDS; BRANCH-WIDTH; CITED PAPERS; CLIQUE-WIDTH; INPUT GRAPHS; MATROID; MATROIDS; RANK-WIDTH; RUNNING TIMES; SEPARATE ALGORITHMS; SUBMODULAR FUNCTIONS; TIME ALGORITHMS;

GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 57849167967     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1435375.1435385     Document Type: Article

References (28)

1. BOUCHET, A. 1988. Graphic presentations of isotropic systems. J. Combin, Theory Ser. B 45, 1, 58-76.
2. BOUCHET, A. 1989. Connectivity of isotropic systems. In Combinatorial Mathematics: Proceedings of the 3rd International Conference (1985). Anuals of the New York Academy of Science, vol. 555. New York Academy of Science, New York, 81-93.
3. BOUCHET, A. 1990. K-transformations, local complementations and switching. In Cycles and Rays (Montreal, PQ, 1987). NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., vol. 301. Kluwer Academic, Dordrecht, Germany, 41-50.
4. BOUCHET, A. 1994. Circle graph obstructions. J. Combin. Theory Ser. B60, 1, 107-144.
5. CORNEIL, D. G., HABIB, M., LANLIGNEL, J.-M., REED, B., AND ROTICS, U. 2000. Polynomial time recognition of clique-width ≤ 3 graphs (extended abstract). In Proceedings of the 4th Latin American Symposium on Theoretical Informatics, Punta del Este, Uruguay. Lecture Notes in Computer Science, vol. 1776. Springer, Berlin, 126-134.
6. COURCELLE, B. 1997. The expression of graph properties and graph transformations in monadic second- order logic. In Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1. World Science, River Edge, NJ, 313-100.
7. COURCELLE, B. 2006. The monadic second-order logic of graphs XV: On a conjecture by D. Seese. J. Appl. Log. 4, 1, 79-114.
8. COURCELLE, B., MAKOWSKY, J. A., AND ROTICS, U. 2000. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33,2, 125-150.
9. COURCELLE, B., AND OLARIU, S. 2000. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101, 1-3, 77-114.
10. COURCELLE, B., AND OUM, S. 2007. Vertex-Minors, monadic second-order logic, and a conjecture by Seese. J. Combin. Theory Ser. B 97, 1, 91-126.
11. ESPELAGE, W., GURSKI, F., AND WANKE, E. 2001. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In Graph-Theoretic Concepts in Computer ScienceBoltenhagen. Lecture Notes in Computer Science, vol. 2204. Springer, Berlin, 117-128.
12. FELLOWS, M. R., ROSAMOND, F. A., ROTICS, U., AND SZEIDER, S. 2006. Clique-Width minimization is NP-hard. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM Press, New York, 354-362.
13. GEELEN, J. F. 1995. Matchings, matroids and unimodular matrices. Ph.D. thesis, University of Waterloo.
14. GERBER, M. U., AND KOBLER, D. 2003. Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theor. Comput. Sci. 299, 1-3, 719-734.
15. HICKS, I. V., AND MCMURRAY JR., N. B. 2007. The branchwidth of graphs and their cycle matroids. J. Combin. Theory Ser. B 97, 5, 681-692.
16. HLINĚNÝ, P. 2005. A parametrized algorithm for matroid branch-width. SIAM J. Comput. 35, 2, 259-277, loose erratum (electronic).
17. HLINĚNÝ, P., AND OUM, S. 2008. Finding branch-decompositions and rank-decompositions. SIAM J. Comput. accepted.
18. IWATA, S., FLEISCHER, L., AND FUJISHIGE, S. 2001. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48, 4, 761-777.
19. KOBLER, D., AND ROTICS, U. 2003. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126, 2-3, 197-221.
20. MAZOIT, F., AND THOMASSÉ, S. 2005. Branchwidth of graphic matroids. manuscript.
21. OUM, S. 2005a. Graphs of bounded rank-width. Ph.D. thesis, Princeton University.
22. OUM, S. 2005b. Rank-Width and vertex-minors. J. Combin. Theory Ser. B95, 1, 79-100.
23. OUM, S., AND SEYMOUR, P. 2006. Approximating clique-width and branch-width. J. Combin. Theory Ser. B96,4, 514-528.
24. OXLEY, J. G. 1992. Matroid Theory. Oxford University Press, New York,
25. ROBERTSON, N., AND SEYMOUR, P. 1991. Graph minors. X. Obstructions to tree-decomposition. J. Combin, Theory Ser. B 52, 2, 153-190.
26. SEESE, D. 1991. The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic 53, 2, 169-195.
27. SEYMOUR, P., AND THOMAS, R. 1994. Call routing and the ratcatcher. Combinatorial 14, 2, 217-241.
28. WANKE, E. 1994. K-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54, 2-3, 251-266.