A note on clique-width and tree-width for structures

Simple item page
dc.creatorAdler, Hans
dc.creatorAdler, Isolde
dc.date2008-06-02
dc.date2008-06-02
dc.date.accessioned2026-07-07T09:42:06Z
dc.date.available2026-07-07T09:42:06Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0806.0103
dc.identifierhttp://arxiv.org/abs/0806.0103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162060
dc.subjectLogic in Computer Science
dc.subjectF.4.1; G.2.2
dc.titleA note on clique-width and tree-width for structures
dc.typetext

Files

Collections

arXiv