In graph theory, the clique-width of a graph is a parameter that describes the structural complexity of the graph; it is closely related to treewidth… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Bruno Courcelle
- Inf. Process. Lett.
- 2014

We prove that edge contractions do not preserve the property that a set of graphs has bounded clique-width.

Is this relevant?

2010

2010

- Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
- SIAM J. Comput.
- 2010

We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W [1]-hard parameterized by clique-width. It was an… (More)

Is this relevant?

2009

2009

- Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
- SIAM J. Discrete Math.
- 2009

Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems… (More)

Is this relevant?

2009

2009

Many hard problems can be solved efficiently when the input is restricted to graphs of bounded treewidth. By the celebrated… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Sang-il Oum, Paul D. Seymour
- J. Comb. Theory, Ser. B
- 2006

We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two… (More)

Is this relevant?

2005

2005

- Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
- Theory of Computing Systems
- 2005

Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms. The notion of clique-width extends… (More)

Is this relevant?

2005

2005

- Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
- Electronic Colloquium on Computational Complexity
- 2005

Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems… (More)

Is this relevant?

2005

2005

- Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
- Electronic Colloquium on Computational Complexity
- 2005

Clique-width is a graph parameter, defined by a composition mechanism for vertexlabeled graphs, which measures in a certain sense… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Bruno Courcelle, Stephan Olariu
- Discrete Applied Mathematics
- 2000

A graph complexity measure that we call clique-width is associated in a natural way with certain graph decompositions, more or… (More)

Is this relevant?

2000

2000

- Bruno Courcelle
- Discrete Mathematics
- 2000

We de*ne the clique-width of a countable graph. We prove that a countable graph has *nite clique-width i+ its *nite induced… (More)

Is this relevant?