On switching classes, NLC-width, cliquewidth and treewidth
type: Item
instance of: scholarly article
title: On switching classes, NLC-width, cliquewidth and treewidth
zbMATH Open document ID: 1242.05217
author: Hans L. Bodlaender
author: Jurriaan Hage
published in: Theoretical Computer Science
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 6039158
zbMATH Keywords: graph decomposition
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.12.021
OpenAlex ID: W2077329115
Wikidata QID: Q59567556
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q4023227
cites work: Upper bounds to the clique width of graphs
cites work: Q4492680
cites work: Dynamic labeled 2-structures
cites work: Q4448752
cites work: Parallel concepts in graph theory
cites work: On the structure of node-label-controlled graph languages
cites work: Q4489221
cites work: Experimental and Efficient Algorithms
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Q5513521
cites work: \(k\)-NLC graphs and polynomial algorithms
DBLP publication ID: journals/tcs/BodlaenderH12
DOI: 10.1016/J.TCS.2011.12.021
description: scientific article; zbMATH DE number 6039158