Graph operations characterizing rank-width
type: Item
instance of: scholarly article
title: Graph operations characterizing rank-width
zbMATH Open document ID: 1173.05349
author: Mamadou Moustapha Kanté
author: Bruno Courcelle
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5572543
zbMATH Keywords: clique-width
zbMATH Keywords: rank-width
zbMATH Keywords: hierarchical decomposition
zbMATH Keywords: graph operation
describes a project that uses: MONA
MaRDI profile type: Publication
full work available at URL: j.dam.2008.08.026
OpenAlex ID: W2011632049
cites work: Recognizability, hypergraph operations, and logical types
cites work: Q4508369
cites work: On the Relationship Between Clique-Width and Treewidth
cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures
cites work: Q4273871
cites work: Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Upper bounds to the clique width of graphs
cites work: Compact Forbidden-Set Routing
cites work: Query efficient implementation of graphs of bounded clique-width
cites work: The recognizability of sets of graphs is a robust property
cites work: Q5315023
cites work: Q4503944
cites work: Deciding Clique-Width for Graphs of Bounded Tree-Width
cites work: Clique-width minimization is NP-hard
cites work: Parametrized complexity theory.
cites work: Finding Branch-Decompositions and Rank-Decompositions
cites work: Q4489221
cites work: Vertex-minor reductions can simulate edge contractions
cites work: The relative clique-width of a graph
cites work: Algorithmic uses of the Feferman-Vaught theorem
cites work: Rank‐width is less than or equal to branch‐width
cites work: Rank-width and vertex-minors
cites work: Approximating clique-width and branch-width
cites work: Graph minors. V. Excluding a planar graph
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: \(k\)-NLC graphs and polynomial algorithms
DOI: 10.1016/J.DAM.2008.08.026
description: scientific article; zbMATH DE number 5572543