Minimal interval completions
Abstract
We study the problem of adding edges to a graph in order to obtain an interval graph. Our goal is to add an inclusion-minimal set of edges, in which case the resulting graph is called a minimal interval completion of the input. We give in this paper the first polynomial time algorithm solving the minimal interval completion problem.