Minimal proper interval completions
Abstract
Given an arbitrary graph $G$, we compute a proper interval supergraph $H$ of $G$, such that $H$ is inclusion-minimal for this property. Our algorithm, based on a breadth-first search of the input graph, has a linear time complexity.