Abstract

The cutwidth of a graph G is defined to be the smallest integer k such that
the vertices of G can be arranged in a vertex ordering [v1,... ,vn] in a way
that, for every i = 1 , . . . , n 1, there are at most fc
... read more