Approximating rank-width and clique-width quickly

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

Volumn 3787 LNCS, Issue , 2005, Pages 49-58

  Oum, Sang Il ^a,b  

^a PRINCETON UNIVERSITY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECOMPOSITION; GRAPH THEORY; POLYNOMIALS;

BINARY MATROIDS; CLIQUE-WIDTH; POLYNOMIAL-TIME; RANK-WIDTH;

COMPUTER SCIENCE;

EID: 33744946823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_5     Document Type: Conference Paper

References (17)

1. Oum, S., Seymour, P.: Approximating clique-width and branch-width, submitted (2004)
2. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101 (2000) 77-114
3. Oum, S.: Rank-width and vertex-minors. J. Combin. Theory Ser. B (2005) to appear.
4. Oxley, J.G.: Matroid theory. Oxford University Press, New York (1992)
5. Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 (1991) 153-190
6. Iwata, S., Fleischer, L., Pujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM (JACM) 48 (2001) 761-777
7. Geelen, J.F.: Matchings, matroids and unimodular matrices. PhD thesis, University of Waterloo (1995)
8. Courcelle, B.: The monadic second-order logic of graphs XV: On a conjecture by D. Seese. submitted (2004)
9. Seese, D.: The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic 53 (1991) 169-195
10. Hliněný, P.: A parametrized algorithm for matroid branch-width, submitted (2002)
11. Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54 (1994) 251-266
12. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33 (2000) 125-150
13. Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Graph-theoretic concepts in computer science (Boltenhagen, 2001). Volume 2204 of Lecture Notes in Comput. Sci. Springer, Berlin (2001) 117-128
14. Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci. 299 (2003) 719-734
15. Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126 (2003) 197-221
16. Johnson, J.L.: Polynomial time recognition and optimization algorithms on special classes of graphs. PhD thesis, Vanderbuilt University (2003)
17. Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by Seese. submitted (2004)