New Graph Classes of Bounded Clique-Width

Authors:
Andreas Brandstädt;Feodor F. Dragan;Hoàng-Oanh Le;Raffaele Mosca
Affiliations:
Fachbereich Informatik, Universität Rostock, D-18051 Rostock, Germany;Department of Computer Science, Kent State University, Kent, OH 44242, USA;Fachbereich Informatik, Universität Rostock, D-18051 Rostock, Germany;Dipartimento di Scienze, Università degli Studi “G. D’Annunzio’’, Viale Pindaro 42, Pescara 65127, Italy
Venue:
Theory of Computing Systems
Year:
2005

Citing 0
Cited 10

Clique-width minimization is NP-hard

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Exact Algorithms for a Loading Problem with Bounded Clique Width

INFORMS Journal on Computing
Recent developments on graphs of bounded clique-width

Discrete Applied Mathematics
A Complete Characterisation of the Linear Clique-Width of Path Powers

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Computing the Clique-width of large path powers in linear time via a new characterisation of clique-width

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Exploiting restricted linear structure to cope with the hardness of clique-width

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Polynomial-time recognition of clique-width ≤3 graphs

Discrete Applied Mathematics
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Note: The parametric complexity of graph diameter augmentation

Discrete Applied Mathematics
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The clique-width of graphs is a major new concept with respect to the efficiency of graph algorithms; it is known that every problem expressible in a certain kind of Monadic Second Order Logic called LinEMSOL(τ1,L) by Courcelle et al. is linear-time solvable on any graph class with bounded clique-width for which a k-expression for the input graph can be constructed in linear time. The notion of clique-width extends the one of treewidth since bounded treewidth implies bounded clique-width. We give a complete classification of all graph classes defined by forbidden one-vertex extensions of the P4 (i.e., the path with four vertices a,b,c,d and three edges ab,bc,cd) with respect to bounded clique-width. Our results extend and improve recent structural and complexity results in a systematic way.