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
2 GAMoC

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

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