Minimal Interval Completion Through Graph Exploration
Résumé
Given an arbitrary graph G=(V,E) and an interval supergraph H=(V,F), we say that H is an interval completion of G. The graph H is called a minimal interval completion of G if, for any sandwich graph H ′ = (V,F ′) between G and H, H ′ is not an interval graph. In this paper we give an O(nm) time algorithm computing a minimal interval completion of an arbitrary graph. The output is an interval model of the completion.