ON FINDING THE MINIMUM BANDWIDTH OF INTERVAL-GRAPHS

被引：19
|
作者：
MAHESH, R
RANGAN, CP
SRINIVASAN, A
机构：
[1] Department of Computer Science and Engineering, Indian Institute of Technology, Madras
来源：
INFORMATION AND COMPUTATION | 1991年 / 95卷 / 02期
关键词：
D O I：
10.1016/0890-5401(91)90045-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Let G = (V, E) be an interval graph, with |V| = n, and |E| = m. An O(n2 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. © 1991.
引用
收藏
页码：218 / 224
页数：7
相关论文
共 50 条
12345