Minimizing NLC-width is NP-complete

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

Volumn 3787 LNCS, Issue , 2005, Pages 69-80

  Gurski, Frank ^a   Wanke, Egon ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; TREES (MATHEMATICS);

CLIQUE-WIDTH; NLC-WIDTH; NP-COMPLETE; ROOT GRAPH; TREE-WIDTH;

GRAPH THEORY;

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

References (20)

1. S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embecldings in a k-tree. SIAM Journal of Algebraic and Discrete Methods, 8(2):227-284, 1987.
2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Journal of the ACM, 40(5):1134-1164, 1993.
3. H.L. Bodlaender, J.R. Gilbert, H. Hafsteinsson, and T. Kicks. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Journal of Algorithms, 18(2):238-255, 1995.
4. 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, volume 1776 of LNCS, pages 126-134. Springer-Verlag, 2000.
5. D.G. Cornell, Y. Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4):926-934, 1985.
6. 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.
7. B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101:77-114, 2000.
8. 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.
9. F. Gurski and E. Wanke. Vertex disjoint paths on clique-width bounded graphs (Extended abstract). In Proceedings of Latin American Symposium on Theoretical Informatics, volume 2976 of LNCS, pages 119-128. Springer-Verlag, 2004.
10. F. Gurski and E. Wanke. Line graphs of bounded clique-width. Manuscript, available at "http://www.acs.uni-duesseldorf.de/~gurski", submitted, 2005.
11. F. Gurski and E. Wanke. On the relationship between NLC-width and linear NLC-width. Manuscript, accepted for Theoretical Computer Science, 2005.
12. Ö. Johansson. Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs. Congressus Numerantium, 132:39-60, 1998.
13. 2-decomposition in polynomial time. International Journal of Foundations of Computer Science, 11(3):373-395, 2000.
14. D. Kobler and U. Rotics. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics, 126(2-3):197-221, 2003.
15. P.G.H. Lehot. An optimal algorithm to detect a line graph and output its root graph. Journal of the ACM, 21(4):569-575, 1974.
16. V. Lozin and D. Rautenbach. The tree- and clique-width of bipartite graphs in special classes. Technical Report RRR 33-2004, Rutgers University, 2004.
17. N. Robertson and P.D. Seymour. Graph minors I. Excluding a forest. Journal of Combinatorial Theory, Series B, 35:39-61, 1983.
18. N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms, 7:309-322, 1986.
19. E. Wanke. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, 54:251-266, 1994.
20. H. Whitney. Congruent graphs and the connectivity of graphs. American Journal of Mathematics, 54:150-168, 1932.