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

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

Christophe Crespelle ¹ Ioan Todinca ²

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

Domain :

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

Complete list of metadata

https://hal.inria.fr/hal-00869977
Contributor : Ioan Todinca Connect in order to contact the contributor
Submitted on : Friday, October 4, 2013 - 3:43:25 PM
Last modification on : Thursday, January 20, 2022 - 5:31:10 PM

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

Links full text

Identifiers

Collections

Citation

Export

Metrics

Contact Legal Notice Personal Data

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

Links full text

Identifiers

Collections

Citation

Export

Share

Metrics

Contact Legal Notice Personal Data