Skip to Main content Skip to Navigation
Journal articles

An $O(n^2)$ time algorithm for the minimal permutation completion problem

Christophe Crespelle 1 Anthony Perez 2 Ioan Todinca 2
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 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
Document type :
Journal articles
Complete list of metadatas
https://hal.inria.fr/hal-01969498
Contributor : Christophe Crespelle <>
Submitted on : Friday, January 4, 2019 - 11:06:56 AM
Last modification on : Monday, February 10, 2020 - 12:17:19 PM

Identifiers

Collections

CNRS | UNIV-LYON2 | UNIV-LYON3 | ENS-LYON | UNIV-LYON1 | INSA-LYON | INRIA | UNIV-ORLEANS | LIP | INSA-GROUPE | UGA | INSA-CVL | UDL

Citation

Christophe Crespelle, Anthony Perez, Ioan Todinca. An $O(n^2)$ time algorithm for the minimal permutation completion problem. Discrete Applied Mathematics, Elsevier, 2018, pp.1-16. ⟨10.1016/j.dam.2018.06.036⟩. ⟨hal-01969498⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

123

 

Contact                    Legal Notice                    Personal Data