In this paper, an O(n3) algorithm is given for finding a minimum weighted maximal irredundant set of an interval graph.
CITATION STYLE
Rangan, C. P., & Chang, M. S. (1994). Weighted irredundance of interval graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 567–574). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_224
Mendeley helps you to discover research relevant for your work.