Clique-width is one of the most important graph parameters, as many NP-hard graph problems are solvable in linear time on graphs of bounded clique-width. Unfortunately, the computation of clique-width is among the hardest problems. In fact, we do not know of any other algorithm than brute force for the exact computation of clique-width on any large graph class of unbounded clique-width. Another difficulty about clique-width is the lack of alternative characterisations of it that might help in coping with its hardness. In this paper, we present two results. The first is a new characterisation of clique-width based on rooted binary trees, completely without the use of labelled graphs. Our second result is the exact computation of the clique-width of large path powers in polynomial time, which has been an open problem for a decade. The presented new characterisation is used to achieve this latter result. With our result, large k-path powers constitute the first non-trivial infinite class of graphs of unbounded clique-width whose clique-width can be computed exactly in polynomial time. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Heggernes, P., Meister, D., & Rotics, U. (2011). Computing the clique-width of large path powers in linear time via a new characterisation of clique-width. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6651 LNCS, pp. 233–246). https://doi.org/10.1007/978-3-642-20712-9_18
Mendeley helps you to discover research relevant for your work.