 |
|
|
|
| HAL: hal-00480750, version 1 |
| Detailed view |  Export this paper |
|
|
| Theory and Applications of Model of Computation (TAMC 2010), Tchèque, République (2010) |
|
|
|
|
| An $O(n^2)$-time Algorithm for the Minimal Interval Completion Problem |
|
|
| Christophe Crespelle 1Ioan Todinca 2 |
|
|
| (2010) |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique de Paris 6 (LIP6) |
|
|
|
CNRS : UMR7606 – Université Paris VI - Pierre et Marie Curie |
|
|
| 2: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Data Structures and Algorithms |
| hal-00480750, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00480750 | |
| oai:hal.archives-ouvertes.fr:hal-00480750 | |
| From: Ioan Todinca | |
| Submitted on: Tuesday, 4 May 2010 18:10:35 | |
| Updated on: Friday, 3 September 2010 09:53:13 | |
