On a disparity between relative cliquewidth and relative NLC-width
type: Item
instance of: scholarly article
title: On a disparity between relative cliquewidth and relative NLC-width
zbMATH Open document ID: 1210.05163
author: Haiko Müller
author: Ruth Urner
published in: Discrete Applied Mathematics
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 5711874
zbMATH Keywords: cliquewidth
zbMATH Keywords: NLC-width
zbMATH Keywords: exact algorithm
zbMATH Keywords: characterisation
MaRDI profile type: MaRDI publication profile
full work available at URL: j.dam.2009.06.024
OpenAlex ID: W2169976284
cites work: Q4508369
cites work: Handle-rewriting hypergraph grammars
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Compact Forbidden-Set Routing
cites work: Deciding Clique-Width for Graphs of Bounded Tree-Width
cites work: Clique-width minimization is NP-hard
cites work: On the relationship between NLC-width and linear NLC-width
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Graphs of Linear Clique-Width at Most 3
cites work: Q4489221
cites work: NLC2-DECOMPOSITION IN POLYNOMIAL TIME
cites work: NLC-2 Graph Recognition and Isomorphism
cites work: The relative clique-width of a graph
cites work: Approximating clique-width and branch-width
cites work: \(k\)-NLC graphs and polynomial algorithms
DOI: 10.1016/J.DAM.2009.06.024
description: scientific article; zbMATH DE number 5711874