Skip to search formSkip to main contentSkip to account menu

Clique-width

Known as: Clique width, Cliquewidth, Width (disambiguation) 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
ACM Transactions on AlgorithmsApproximation algorithmChromatic polynomialClique (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Clique-width and tree-width of sparse graphs
Tree-width and clique-width are two important graph complexity measures that serve as parameters in many xed-parameter tractable… 
2013
2013
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of… 
2012
2012
Multicut on Graphs of Bounded Clique-Width
Several variants of Multicut problems arise in applications like circuit and network design. In general, these problems are NP… 
2010
2010
Decision Problems for Petri Nets with Names
AbstractWe prove several decidability and undecidability results for ν-PN, an exten-sion of P/T nets with pure name creation and… 
2010
2010
The characteristics of H320LA steel sheet clinching joints
S u m m a r y The methods based on the energy principles were used to determine the Interlaminar Fracture Toughness of selected… 
2008
2008
Impact of Summer Thermal Stratification on Depth Profile of Phytoplankton Productivity, Biomass, Density and Photosynthetic Capacity in Lake Nasser (Egypt)
* Corresponding author. amedmonem@ yahoo.com Lake Nasser is a headwater of Nile River in Egyptian territory. In wintertime, there… 
2007
2007
Clique-width of unit interval graphs
The clique-width is known to be unbounded in the class of unit interval graphs. In this paper, we show that this is a minimal… 
2006
2006
Exact Algorithms for a Loading Problem with Bounded Clique Width
In this paper we discuss a special pallet-loading problem, which we encountered at a manufacturing company. In graph-theoretical… 
2005
2005
Localized and compact data-structure for comparability graphs
2005
2005
Proving NP-hardness for clique-width II: non-approximability of clique-width
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)