On minimal augmentation of a graph to obtain an interval graph

https://doi.org/10.1016/0022-0000(81)90022-2Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper deals with the problem of adding edges to a graph such that the resulting graph becomes an interval graph. The set of edges added is called an augmentation. An algorithm is presented to find a minimal augmentation which runs in a time proportional to the product of the number of vertices and the number of edges of the resulting graph.

Cited by (0)