A note on clique-width and tree-width for structures
classification
💻 cs.LO
keywords
structuresclique-widthtree-widthallowingarbitraryboundedcorrectedelements
read the original abstract
We give a simple proof that the straightforward generalisation of clique-width to arbitrary structures can be unbounded on structures of bounded tree-width. This can be corrected by allowing fusion of elements.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.