An O(n^2)-time algorithm for the minimal interval completion problem

Christophe Crespelle 1 Ioan Todinca 2
1 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
2 GAMoC
LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-00869977
Contributor : Ioan Todinca <>
Submitted on : Friday, October 4, 2013 - 3:43:25 PM
Last modification on : Thursday, November 21, 2019 - 2:41:28 AM

Links full text

Identifiers

Citation

Christophe Crespelle, Ioan Todinca. An O(n^2)-time algorithm for the minimal interval completion problem. Theoretical Computer Science, Elsevier, 2013, 494, pp.75-85. ⟨10.1016/j.tcs.2012.12.031⟩. ⟨hal-00869977⟩

Share

Metrics

Record views

280