The two-dimensional bandwidth problem is to determine an embedding of graph G in a grid graph in the plane such that the......

The cutwidth problem for a graph G is to embed G into a path such that the maximum number of overlap edges is minimized.......