Deciding clique-width for graphs of bounded tree-width

Journal of Graph Algorithms and Applications

Volumn 7, Issue 2, 2003, Pages 141-180

  Espelage, Wolfgang ^a   Gurski, Frank ^a   Wanke, Egon ^a  

^a Department of Computer Science ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; FORESTRY;

CLIQUE-WIDTH; FIXED INTEGERS; LINEAR-TIME ALGORITHMS; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 4043179684     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00065     Document Type: Conference Paper

References (21)

1. [ALS91] S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12:308-340, 1991.
2. [AP89] S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems on graphs embedded in k-trees. Discrete Applied Mathematics, 23:11-24, 1989.
3. [Arn85] S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey. BIT, 25:2-23, 1985.
4. [Bod96] H.L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305-1317, 1996.
5. [Bod97] H.L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proceedings of Mathematical Foundations of Computer Science, volume 1295 of LNCS, pages 29-36. Springer-Verlag, 1997.
6. [Bod98] H.L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1-45, 1998.
7. [CHL+00] D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, and U. Rotics. Polynomial time recognition of clique-width at most three graphs. In Proceedings of Latin American Symposium on Theoretical Informatics (LATIN '2000), volume 1776 of LNCS. Springer-Verlag, 2000.
8. [CMR00] B. Courcelle, J.A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems, 33(2):125-150, 2000.
9. [CO00] B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101:77-114, 2000.
10. [Cou90] B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
11. [CPS85] D.G. Corneil, Y. Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4):926-934, 1985.
12. [CR01] D.G. Corneil and U. Rotics. On the relationship between clique-width and treewidth. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 2204 of LNCS, pages 78-90. Springer-Verlag, 2001.
13. [EGW01] W. Espelage, F. Gurski, and E. Wanke. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 2204 of LNCS, pages 117-128. Springer-Verlag, 2001.
14. [GR00] M.C. Golumbic and U. Rotics. On the clique-width of some perfect graph classes. IJFCS: International Journal of Foundations of Computer Science, 11(3):423-443, 2000.
15. n,n. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1938 of LNCS, pages 196-205. Springer-Verlag, 2000.
16. [Joh98] Ö. Johansson. Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs. Congressus Numerantium, 132:39-60, 1998.
17. [KR01] D. Kobler and U. Rotics. Polynomial algorithms for partitioning problems on graphs with fixed clique-width. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 468-476. ACM-SIAM, 2001.
18. [Lap98] D. Lapoire. Recognizability equals de.nability, for every set of graphs of bounded tree-width. In Proceedings 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of LNCS, pages 618-628. Springer-Verlag, 1998.
19. [LW88] T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined graphs. SIAM Journal on Computing, 17(6):1063-1080, 1988.
20. [LW93] T. Lengauer and E. Wanke. Efficient analysis of graph properties on context-free graph languages. Journal of the ACM, 40(2):368-393, 1993.
21. [Wan94] E. Wanke. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, 54:251-266, 1994, revised version: http://www.cs.uni- duesseldorf.de/~wanke.