Graph-Theoretic Concepts in Computer Science

Volume 1928 of the series Lecture Notes in Computer Science pp 243-254


Bandwidth of Split and Circular Permutation Graphs

  • Ton KloksAffiliated withDepartment of Mathematics and Computer Science, Vrije Universiteit Amsterdam
  • , Dieter KratschAffiliated withLaboratoire d’Informatique Théorique et Appliquée, Université de Metz
  • , Yvan Le BorgneAffiliated withLaboratoire Bordelais de Recherche en Informatique
  • , Haiko MüllerAffiliated withFakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena

* Final gross prices may vary according to local VAT.

Get Access


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.