Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Clique-width> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Clique-width abstract "In graph theory, the clique-width of a graph is the minimum number of labels needed to construct by means of the following 4 operations :Creation of a new vertex v with label i ( noted i(v) )Disjoint union of two labeled graphs G and H ( denoted )Joining by an edge every vertex labeled i to every vertex labeled j (denoted n(i,j)), where Renaming label i to label j ( denoted p(i,j) )Cographs are exactly the graphs with clique-width at most 2 (Courcelle & Olariu 2000); every distance-hereditary graph has clique-width at most 3 (Golumbic & Rotics 2000). Many optimization problems that are NP-hard for more general classes of graphs may be solved efficiently by dynamic programming on graphs of bounded clique-width (Cogis & Thierry 2005; Courcelle, Makowsky & Rotics 2000).The theory of graphs of bounded clique-width resembles that for graphs of bounded treewidth, but unlike treewidth allows for dense graphs. If a family of graphs has bounded clique-width, then either it has bounded treewidth or every complete bipartite graph is a subgraph of a graph in the family (Gurski & Wanke 2000).".
- Clique-width wikiPageID "16795502".
- Clique-width wikiPageRevisionID "576388212".
- Clique-width hasPhotoCollection Clique-width.
- Clique-width subject Category:Graph_invariants.
- Clique-width type Abstraction100002137.
- Clique-width type Cognition100023271.
- Clique-width type Concept105835747.
- Clique-width type Content105809192.
- Clique-width type Feature105849789.
- Clique-width type GraphInvariants.
- Clique-width type Idea105833840.
- Clique-width type Invariant105850432.
- Clique-width type Property105849040.
- Clique-width type PsychologicalFeature100023100.
- Clique-width comment "In graph theory, the clique-width of a graph is the minimum number of labels needed to construct by means of the following 4 operations :Creation of a new vertex v with label i ( noted i(v) )Disjoint union of two labeled graphs G and H ( denoted )Joining by an edge every vertex labeled i to every vertex labeled j (denoted n(i,j)), where Renaming label i to label j ( denoted p(i,j) )Cographs are exactly the graphs with clique-width at most 2 (Courcelle & Olariu 2000); every distance-hereditary graph has clique-width at most 3 (Golumbic & Rotics 2000). ".
- Clique-width label "Clique-width".
- Clique-width label "Cliquenweite".
- Clique-width sameAs Cliquenweite.
- Clique-width sameAs m.0406f80.
- Clique-width sameAs Q1101814.
- Clique-width sameAs Q1101814.
- Clique-width sameAs Clique-width.
- Clique-width wasDerivedFrom Clique-width?oldid=576388212.
- Clique-width isPrimaryTopicOf Clique-width.