| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950881 | Information Processing Letters | 2017 | 5 Pages |
Abstract
We present an algorithm to compute the clique-separator graph of an interval graph in O(m+n) time. This improves the running time of O(n2) given in [11]. The algorithm is simple and uses no complicated data structures.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Louis Ibarra,