Approximating bandwidth by mixing layouts of interval graphs

Authors:
Dieter Kratsch;Lorna Stewart
Affiliations:
Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität, Jena, Germany;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 13
Cited 2

The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete

SIAM Journal on Algebraic and Discrete Methods
Computing the bandwidth of interval graphs

SIAM Journal on Discrete Mathematics
On finding the minimum bandwidth of interval graphs

Information and Computation
An $0(n \log n)$ Algorithm for Bandwidth of Interval Graphs

SIAM Journal on Discrete Mathematics
The bandwidth of a tree with k leaves is at most k2

Discrete Mathematics - Special issue: selected papers in honour of Paul Erdo&huml;s on the occasion of his 80th birthday
Polygon graph recognition

Journal of Algorithms
Minimum fill-in on circle and circular-arc graphs

Journal of Algorithms
An O(n2 algorithm for circular-arc graph recognition

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The ultimate interval graph recognition algorithm?

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Bandwidth for Asteroidal Triple-Free Graphs

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
The Complexity of the Approximation of the Bandwidth Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating the Bandwidth via Volume Respecting Embeddings (Preliminary Version 3)

Approximating the Bandwidth via Volume Respecting Embeddings (Preliminary Version 3)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Bandwidth of Split and Circular Permutation Graphs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Interval degree and bandwidth of a graph

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). We show that all of these graph classes admit efficient approximation algorithms which are based on exact or approximate bandwidth layouts of related interval graphs. Specifically, we obtain a bandwidth approximation algorithm for circular-arc graphs that executes in O(n log2 n) time and has performance ratio 2, which is the best possible performance ratio of any polynomial time bandwidth approximation algorithm for circular-arc graphs. For chordal graphs with not more than k leaves in the clique tree, we obtain a performance ratio of 2k in O(k(n + m)) time, and our algorithm for k-polygon graphs has performance ratio 2k2 and runs in time O(n3).