On switching classes, NLC-width, cliquewidth and treewidth

DOI10.1016/j.tcs.2011.12.021zbMath1242.05217DBLPjournals/tcs/BodlaenderH12OpenAlexW2077329115WikidataQ59567556 ScholiaQ59567556MaRDI QIDQ418754

Hans L. Bodlaender, Jurriaan Hage

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.021

zbMATH Keywords

graph decomposition

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• On the structure of node-label-controlled graph languages
• A partial k-arboretum of graphs with bounded treewidth
• Parallel concepts in graph theory
• \(k\)-NLC graphs and polynomial algorithms
• Upper bounds to the clique width of graphs
• A Linear Recognition Algorithm for Cographs
• Graph minors. II. Algorithmic aspects of tree-width
• Dynamic labeled 2-structures
• Experimental and Efficient Algorithms

This page was built for publication: On switching classes, NLC-width, cliquewidth and treewidth