How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time

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

Volumn 2204, Issue , 2001, Pages 117-128

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

^a Department of Computer Science ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

BIPARTITE SUBGRAPHS; HAMILTONIAN PATH; MINIMUM MAXIMAL MATCHING; PARTITION INTO CLIQUES; PERFECT MATCHINGS; POLYNOMIAL-TIME; SEPARATION PROBLEMS; SIMPLE SCHEMES;

GRAPH THEORY;

EID: 84945303807     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45477-2_12     Document Type: Article

References (11)

1. 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.
2. 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.
3. B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101: 77-114, 2000.
4. D.G. Corneil, Y. Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4): 926-934, 1985.
5. D.G. Corneil and U. Rotics. On the relationship between clique-width and tree-width. In Proceedings of Graph-Theoretical Concepts in Computer Science, LNCS, Springer-Verlag, 2001. to appear
6. M.C. Golumbic and U. Rotics. On the clique-width of perfect graph classes. IJFCS: International Journal of Foundations of Computer Science, 11(3): 423-443, 2000.
7. n, n. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1938 of LNCS, pages 196-205. Springer-Verlag, 2000.
8. Ö. Johansson. Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs. Congressus Numerantium, 132: 39-60, 1998.
9. Ö. Johansson. NLC2 decomposition in polynomial time. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1665 of LNCS, pages 110-121. Springer-Verlag, 1999.
10. 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.
11. E. Wanke. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, 54: 251-266, 1994. Revised version, quot;http://www.cs.uni-duesseldorf.de/wanke".