Recent developments on graphs of bounded clique-width

Whether the clique-width of graphs in a certain class of graphs is bounded or not, is an important question from an algorithmic point of view, as many problems that are NP-hard in general admit polynomial-time solutions when restricted to graphs of bounded clique-width. Over the last few years, many...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 157; no. 12; pp. 2747 - 2761
Main Authors Kamiński, Marcin, Lozin, Vadim V., Milanič, Martin
Format Journal Article Conference Proceeding
LanguageEnglish
Published Kidlington Elsevier B.V 28.06.2009
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Clique-width
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Hereditary class
Information retrieval. Graph
Mathematics
Rank-width
Sciences and techniques of general use
Theoretical computing
Tree-width
Tree-width
Rank-width
Hereditary class
Clique-width
Clique width
Computer theory
Graph clique
Algorithmics
Rank
Optimization
Polynomial time
Survey
Tree width
NP hard problem
Combinatorics
Online AccessGet full text

Cover

More Information
Summary:Whether the clique-width of graphs in a certain class of graphs is bounded or not, is an important question from an algorithmic point of view, as many problems that are NP-hard in general admit polynomial-time solutions when restricted to graphs of bounded clique-width. Over the last few years, many classes of graphs have been shown to have bounded clique-width. For many others, this parameter has been proved to be unbounded. This paper provides a survey of recent results addressing this problem.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2008.08.022