An O(n^2)-time algorithm for the minimal interval completion problem - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2013

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

(1) , (2)
1
2

Dates and versions

hal-00869977 , version 1 (04-10-2013)

Identifiers

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⟩
118 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More