Journal Articles
Theoretical Computer Science
Year : 2013
Ioan Todinca : Connect in order to contact the contributor
https://hal.inria.fr/hal-00869977
Submitted on : Friday, October 4, 2013-3:43:25 PM
Last modification on : Tuesday, October 25, 2022-4:24:03 PM
Cite
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⟩
Collections
118
View
0
Download