A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
Data Structures and Algorithms
2014-02-11 v1 Computational Complexity
Discrete Mathematics
Abstract
We investigate a new width parameter, the fusion-width of a graph. It is a natural generalization of the tree-width, yet strong enough that not only graphs of bounded tree-width, but also graphs of bounded clique-width, trivially have bounded fusion-width. In particular, there is no exponential growth between tree-width and fusion-width, as is the case between tree-width and clique-width. The new parameter gives a good intuition about the relationship between tree-width and clique-width.
Cite
@article{arxiv.1402.1810,
title = {A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width},
author = {Martin Fürer},
journal= {arXiv preprint arXiv:1402.1810},
year = {2014}
}
Comments
To appear in the proceedings of Latin 2014. Springer LNCS 8392