Bandwidth of Split and Circular Permutation Graphs
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.
Unable to display preview. Download preview PDF.
- 2.Blum, A., G. Konjevod, R. Ravi and S. Vempala, Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (Dallas, TX, 1998), pp. 111–105.Google Scholar
- 4.Chung, F. R. K., Labelings of graphs, Selected topics in graph theory 3 (1988), pp. 151–168.Google Scholar
- 6.Feige, U., Approximating the bandwidth via volume respecting embeddings, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing(Dallas, TX, 1998).Google Scholar
- 8.Gurari, E. M. and I. H. Sudborough, Improved dynamic programming algorithms for bandwidth minimization and the MinCut linear arrangement problem, J. Algorithms 5 (1984), pp. 531–546.Google Scholar
- 15.Kratsch, D. and L. Stewart, Approximating bandwidth by mixing layouts of interval graphs, Proceedings of STACS’99, LNCS 1563, pp. 248–258.Google Scholar
- 19.Parra, A., structural and algorithmic aspects of chordal graph embeddings, PhD-thesis, Technische Universität Berlin, 1996.Google Scholar
- 22.Unger, W., The complexity of the approximation of the bandwidth problem, Proceedings of the 39th Annual Symposium on Foundations of Computer Science (Palo Alto, California, 1998), pp. 82–91.Google Scholar