Minimal interval completions - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Minimal interval completions

Pinar Heggernes
  • Function : Author
  • PersonId : 836753
Yngve Villanger
  • Function : Author


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.
No file

Dates and versions

hal-00085564 , version 1 (12-07-2006)


  • HAL Id : hal-00085564 , version 1


Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger. Minimal interval completions. 2005, pp.403-414. ⟨hal-00085564⟩
22 View
0 Download


Gmail Facebook Twitter LinkedIn More