Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
type: Item
instance of: scholarly article
title: Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
zbMATH Open document ID: 1042.68092
DOI: 10.1016/S0304-3975(02)00725-9
author: Michael U. Gerber
author: Daniel Kobler
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1915592
zbMATH Keywords: Graph partitioning
zbMATH Keywords: Polynomial algorithms
zbMATH Keywords: Clique-width
MaRDI profile type: Publication
cites work: An algebraic theory of graph reduction
cites work: Easy problems for tree-decomposable graphs
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Majority domination in graphs
cites work: Q4508369
cites work: Handle-rewriting hypergraph grammars
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Upper bounds to the clique width of graphs
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q3691778
cites work: Q3691779
cites work: Q4198056
cites work: Algorithmic approach to the satisfactory graph partitioning problem
cites work: Splitting trees
cites work: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
cites work: Algorithmic aspects of majority domination
cites work: Graph colorings with local constraints -- a survey
description: scientific article; zbMATH DE number 1915592