Date: 18 Jul 2002

Bandwidth of Split and Circular Permutation Graphs

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The BANDWIDTH minimization problem on graphs of some special graph classes is studied and the following results are obtained. The problem remains NP-complete when restricted to splitgraphs. There is a linear time algorithm to compute the exact bandwidth of a subclass of splitgraphs called hedgehogs. There is an efficient algorithm to approximate the bandwidth of circular permutation graphs within a factor of four.