Finding the Minimum Bandwidth of an Interval Graphs

@article{Kratsch1987FindingTM,
  title={Finding the Minimum Bandwidth of an Interval Graphs},
  author={Dieter Kratsch},
  journal={Inf. Comput.},
  year={1987},
  volume={74},
  pages={140-158}
}
Abstract An assignment of unique integers to the vertices of a graph is called a linear layout. The bandwidth minimization problem (BANDWIDTH) is the following: Given a graph G = ( V , E ) and an integer k , determine whether there exists a linear layout of G such that the maximum difference between adjacent vertices is bounded by k . Interval graphs are the intersection graphs of a family of intervals of the real line. BANDWIDTH remains NP-complete even when restricted to special subclasses of… CONTINUE READING
BETA