Approximating Bandwidth by Mixing Layouts of Interval Graphs

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).

[1]  Ehab S. Elmallah,et al.  Polygon Graph Recognition , 1998, J. Algorithms.

[2]  C. Pandu Rangan,et al.  On Finding the Minimum Bandwidth of Interval Graphs , 1991, Inf. Comput..

[3]  B. Monien.  The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete , 1986 .

[4]  Ton Kloks.  Treewidth of Circle Graphs , 1996, Int. J. Found. Comput. Sci..

[5]  Jeremy P. Spinrad,et al.  Recognition of Circle Graphs , 1994, J. Algorithms.

[6]  Walter Unger,et al.  The complexity of the approximation of the bandwidth problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[7]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[8]  Alan P. Sprague.  An 0(n log n) Algorithm for Bandwidth of Interval Graphs , 1994, SIAM J. Discret. Math..

[9]  Dieter Kratsch,et al.  Approximating the Bandwidth for Asteroidal Triple-Free Graphs , 1999, J. Algorithms.

[10]  Stephan Olariu,et al.  The ultimate interval graph recognition algorithm? , 1998, SODA '98.

[11]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[12]  V. Chvátal,et al.  A remark on a problem of Harary , 1970 .

[13]  Wen-Lian Hsu,et al.  Recognizing circle graphs in polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Chak-Kuen Wong,et al.  Minimum Fill-in on Circle and Circular-Arc Graphs , 1998, J. Algorithms.

[15]  Jeremy P. Spinrad,et al.  An O(n2 algorithm for circular-arc graph recognition , 1993, SODA '93.

[16]  Kiyoshi Ando,et al.  The bandwidth of a tree with k leaves is at most , 1996, Discret. Math..

[17]  S. Assmann,et al.  The Bandwidth of Caterpillars with Hairs of Length 1 and 2 , 1981 .

[18]  Uriel Feige,et al.  Approximating the Bandwidth via Volume Respecting Embeddings , 2000, J. Comput. Syst. Sci..

[19]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[20]  G. Dirac.  On rigid circuit graphs , 1961 .

[21]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[22]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[23]  G. Khosrovshahi,et al.  Computing the bandwidth of interval graphs , 1990 .

[24]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[25]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .