In graph theory, the cutwidth of an undirected graph G = (V, E) is the smallest integer k with the following property: there is an ordering {v1, …, vn} of the vertices of G, such that for every l = 1, …, n – 1, there are at most k edges with one endpoint in {v1, …, vl} and the other endpoint in {vl + 1, …, vn} .
Attributes | Values |
---|---|
rdfs:label |
|
rdfs:comment |
|
dcterms:subject | |
Wikipage page ID |
|
Wikipage revision ID |
|
Link from a Wikipage to another Wikipage | |
sameAs | |
dbp:wikiPageUsesTemplate | |
has abstract |
|
prov:wasDerivedFrom | |
page length (characters) of wiki page |
|
foaf:isPrimaryTopicOf | |
is Link from a Wikipage to another Wikipage of | |
is foaf:primaryTopic of |