The bandwidth problem is the problem of enumerating
the vertices of a given graph G such that the maximum difference
between the numbers of adjacent vertices is minimal. The problem
has a long history and a number of applications.
There was not ... more >>>