论文信息 - On Finding the Minimum Bandwidth of Interval Graphs

On Finding the Minimum Bandwidth of Interval Graphs

Abstract Let G = ( V , E ) be an interval graph , with | V | = n , and | E | = m . An O ( n 2 log n ) algorithm was proposed in Kratsch ( Inform Comput. 74 , 140–158 (1987)) to find the bandwidth of G . We show that this algorithm is wrong, and provide a corrected version of the same. Also, it was observed in [4] that the bandwidth of a proper interval graph can be computed in O ( n log n + m ) time. We show how this idea can be modified slightly to yield an O ( n = m ) algorithm.

[1] J. Mark Keil. Finding Hamiltonian Circuits in Interval Graphs , 1985, Inf. Process. Lett..

[2] C. P. Rangan,et al. A Unified Approach to Domination Problems on Interval Graphs , 1988, Inf. Process. Lett..

[3] Dieter Kratsch,et al. Finding the Minimum Bandwidth of an Interval Graphs , 1987, Inf. Comput..

[4] C. Pandu Rangan,et al. Linear Algorithm for Domatic Number Problem on Interval Graphs , 1989, Inf. Process. Lett..

[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[6] 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..