Abstract
AbstractGiven 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 \({{\mathcal{O}}(n+m)}\) time algorithm computing a minimal proper interval completion of an arbitrary graph. The output is a proper interval model of the completion.KeywordsMaximal CliqueInterval GraphMinimal SeparatorArbitrary GraphInterval ModelThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
