Minimal interval completion through graph exploration

Karol Suchan (1) , Ioan Todinca (2)

1 Facultad de Ingeniería y Ciencias [Santiago]
2 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

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.

Domains: Data Structures and Algorithms [cs.DS]

Karol Suchan, Ioan Todinca. Minimal interval completion through graph exploration. Theoretical Computer Science, 2009, 410 (1), pp.35-43. ⟨10.1016/j.tcs.2008.09.053⟩. ⟨hal-00462385⟩