Highly Influenced

# Clique-width and treewidth of sparse graphs

@inproceedings{Labri2015CliquewidthAT, title={Clique-width and treewidth of sparse graphs}, author={Bruno Courcelle Labri}, year={2015} }

- Published 2015

Tree-width and clique-width are two important graph complexity measures that serve as parameters in many fixed-parameter tractable (FPT) algorithms. The same classes of sparse graphs, in particular of planar graphs and of graphs of bounded degree have bounded tree-width and bounded clique-width. We prove that, for sparse graphs, clique-width is polynomially bounded in terms of tree-width. For planar and incidence graphs, we establish linear bounds. Our motivation is the construction of FPT… CONTINUE READING