# 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} }

- Published in Inf. Comput. 1987
DOI:10.1016/0890-5401(87)90028-9

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

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-8 OF 8 CITATIONS

## On Finding the Minimum Bandwidth of Interval Graphs

VIEW 14 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Tractabilities and Intractabilities on Geometric Intersection Graphs

VIEW 1 EXCERPT

CITES BACKGROUND

## An improved simulated annealing algorithm for bandwidth minimization

VIEW 1 EXCERPT

CITES BACKGROUND

## A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

VIEW 1 EXCERPT

CITES METHODS

## Finding Exact Solutions to the Bandwidth Minimization Problem

VIEW 1 EXCERPT

CITES BACKGROUND