4 research outputs found
A Polynomial Time Algorithm for the cutwidth of bounded degree graphs with small treewidth
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..
4 research outputs found