Abstract
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E ⊆ F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich graph H′ = (V, F′) with E ⊆ F′ ⊂ F, H′ is not a proper interval graph. In this paper we give a Ο(n + m) time algorithm computing a minimal proper interval completion of an arbitrary graph. The output is a proper interval model of the completion. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Rapaport, I., Suchan, K., & Todinca, I. (2006). Minimal proper interval completions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4271 LNCS, pp. 217–228). Springer Verlag. https://doi.org/10.1007/11917496_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
