Clique-width
id:
clique-width-189-3590199
title:
Clique-width
text:
In graph theory, the clique-width of a graph G is a parameter that describes the structural complexity of the graph; it is closely related to treewidth, but unlike treewidth it can be small for dense graphs.
It is defined as the minimum number of labels needed to construct G by means of the following 4 operations :
- Creation of a new vertex v with label i
- Disjoint union of two labeled graphs G and H
- Joining by an edge every vertex labeled i to every vertex labeled j, where i ≠ j
- R
brand slug:
wiki
category slug:
encyclopedia
description:
Measure of graph complexity
original url:
https://en.wikipedia.org/wiki/Clique-width
date created:
2008-04-06T16:28:00Z
date modified:
2024-09-09T08:12:25Z
main entity:
{"identifier":"Q1101814","url":"https://www.wikidata.org/entity/Q1101814"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/43/Clique-width_construction.svg","width":585,"height":701}
fields total:
13
integrity:
16