Skip to Main content Skip to Navigation

Interval completion is Fixed Parameter Tractable

Christophe Paul 1 Jan Arne Telle 2 Yngve Villanger 2 Pinar Heggerness 2
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We present an algorithm with runtime $O(k^{2k}n^3m)$ for the following NP-complete problem: Given an arbitrary graph $G$ on $n$ vertices and $m$ edges, can we obtain an interval graph by adding at most $k$ new edges to $G$? This resolves the long-standing open question, first posed by Kaplan, Shamir and Tarjan, of whether this problem could be solved in time $f(k).n^{O(1)}$. The problem has applications in Physical Mapping of DNA and in Profile Minimization for Sparse Matrix Computations. For the first application, our results show tractability for the case of a small number $k$ of false negative errors, and for the second, a small number $k$ of zero elements in the envelope. Our algorithm performs bounded search among possible ways of adding edges to a graph to obtain an interval graph, and combines this with a greedy algorithm when graphs of a certain structure are reached by the search. The presented result is surprising, as it was not believed that a bounded search tree algorithm would suffice to answer the open question affirmatively.
Document type :
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Christophe Paul <>
Submitted on : Monday, November 20, 2006 - 8:05:20 PM
Last modification on : Friday, November 20, 2020 - 4:22:03 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 7:17:48 PM


  • HAL Id : lirmm-00115278, version 1



Christophe Paul, Jan Arne Telle, Yngve Villanger, Pinar Heggerness. Interval completion is Fixed Parameter Tractable. [Research Report] RR-06058, Lirmm. 2007. ⟨lirmm-00115278⟩



Record views


Files downloads