@article {17634,
	title = {On finding the minimum bandwidth of interval graphs},
	journal = {Information and Computation},
	volume = {95},
	year = {1991},
	month = {1991/12//},
	pages = {218 - 224},
	abstract = {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{\textendash}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.},
	isbn = {0890-5401},
	doi = {10.1016/0890-5401(91)90045-4},
	url = {http://www.sciencedirect.com/science/article/pii/0890540191900454},
	author = {Mahesh,R. and Rangan,C.Pandu and Srinivasan, Aravind}
}
