Q4448752
type: Item
instance of: scholarly article
zbMATH Open document ID: 1042.68626
author: W. Espelage
author: Frank Gurski
author: Egon Wanke
publication date: 2004-02-18T00:00:00Z
full work available at URL: 22040117.htm
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2044928
MaRDI profile type: Publication
Recommended article: Computing Graph Polynomials on Graphs of Bounded Clique-Width
Recommended article: Q4232773
Recommended article: Linear time solvable optimization problems on graphs of bounded clique-width
Recommended article: Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
Recommended article: Q4608071
Recommended article: Clique-Width is NP-Complete
Recommended article: Q5417642
Recommended article: On graphs with polynomially solvable maximum-weight clique problem
Recommended article: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
Recommended article: Clique-width minimization is NP-hard
description: scientific article; zbMATH DE number 2044928