Clique-width

Known as: Clique width, Cliquewidth 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2017
051019992017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
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
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W [1]-hard parameterized by clique-width. It was an… (More)
  • figure 3.1
  • figure 4.1
  • figure 5.1
  • figure 5.2
Is this relevant?
2009
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)
  • figure 3.1
  • figure 4.1
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)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two… (More)
  • figure 1
Is this relevant?
2005
2005
Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms. The notion of clique-width extends… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
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
Clique-width is a graph parameter, defined by a composition mechanism for vertexlabeled graphs, which measures in a certain sense… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A graph complexity measure that we call clique-width is associated in a natural way with certain graph decompositions, more or… (More)
  • figure 3
  • figure 9
  • figure 13:34
Is this relevant?
2000
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?