Minimal Interval Completion Through Graph Exploration

Karol Suchan (1) , Ioan Todinca (1)

1 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.

Mots clés: interval graph; minimal interval completion; Lex-BFS

Domaines: Algorithme et structure de données [cs.DS]

Karol Suchan, Ioan Todinca. Minimal Interval Completion Through Graph Exploration. Algorithms and Computation, 17th International Symposium (ISAAC 2006), Dec 2006, Kolkata, India. pp.517-526, ⟨10.1007/11940128_52⟩. ⟨hal-00462293⟩