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
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-01969498
Contributor : Accord Elsevier Ccsd Connect in order to contact the contributor
Submitted on : Thursday, October 21, 2021 - 9:44:25 PM
Last modification on : Wednesday, November 3, 2021 - 9:34:18 AM

File

S0166218X18303986.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Identifiers

Citation

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

Share

Metrics

Les métriques sont temporairement indisponibles