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

Christophe Crespelle; Ioan Todinca

doi:10.1016/j.tcs.2012.12.031

Journal Articles Theoretical Computer Science Year : 2013

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

(1) , (2)

1
2

Christophe Crespelle

Function : Author
PersonId : 863155

Dynamic Networks : Temporal and Structural Capture Approach

Ioan Todinca

Function : Author

GAMoC

Domains

Computer Science [cs] Data Structures and Algorithms [cs.DS]

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

Dates and versions

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

Identifiers

HAL Id : hal-00869977 , version 1
DOI : 10.1016/j.tcs.2012.12.031

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

ENS-LYON UNIV-LYON3 UGA CNRS INRIA UNIV-LYON1 UNIV-LYON2 UNIV-ORLEANS INSA-LYON MSL MSL-THESE INRIA2 INSA-GROUPE UDL

118 View

0 Download

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

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share