Cutwidth
http://dbpedia.org/resource/Cutwidth
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} .
rdf:langString
rdf:langString
Cutwidth
xsd:integer
69798178
xsd:integer
1111673184
rdf:langString
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} .
xsd:nonNegativeInteger
1371