Computer Science – Logic in Computer Science
Scientific paper
2008-06-02
Computer Science
Logic in Computer Science
Scientific paper
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.
Adler Hans
Adler Isolde
No associations
LandOfFree
A note on clique-width and tree-width for structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A note on clique-width and tree-width for structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on clique-width and tree-width for structures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-630205