Before revision:  Unfortunately, the exact computation of the clique-width representation is NP-hard \NP . Therefore, good upper-bounds on clique-width are highly appreciated  .
After revision:  Unfortunately, the exact computation of the clique-width representation is NP-hard \NP . Therefore, good upper-bounds on clique-width are highly appreciated , in particular, when such a bound is algorithmic .