An $O(n^2)$-time Algorithm for the Minimal Interval Completion Problem

Abstract : The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval graph; the objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. We give an $O(n^2)$-time algorithm to obtain a minimal interval completion of an arbitrary graph. This improves the previous O(nm) time bound for the problem and lower this bound for the first time below the best known bound for minimal chordal completion.
Document type :
Conference papers
TAMC 2010 - 7th Annual Conference on Theory and Applications of Model of Computation, Jun 2010, Prague, Czech Republic. IEEE, 6108, pp.175-186, 2010, Lecture Notes in Computer Science. 〈10.1007/978-3-642-13562-0_17〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00480750
Contributor : Ioan Todinca <>
Submitted on : Tuesday, May 4, 2010 - 6:10:35 PM
Last modification on : Wednesday, March 21, 2018 - 6:57:58 PM

Identifiers

Collections

Citation

Christophe Crespelle, Ioan Todinca. An $O(n^2)$-time Algorithm for the Minimal Interval Completion Problem. TAMC 2010 - 7th Annual Conference on Theory and Applications of Model of Computation, Jun 2010, Prague, Czech Republic. IEEE, 6108, pp.175-186, 2010, Lecture Notes in Computer Science. 〈10.1007/978-3-642-13562-0_17〉. 〈hal-00480750〉

Share

Metrics

Record views

154