An $O(n^2)$ time algorithm for the minimal permutation completion problem - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2019

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

(1) , (2) , (2)
1
2
Fichier principal
Vignette du fichier
S0166218X18303986.pdf (538.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01969498 , version 1 (21-10-2021)

Licence

Attribution - NonCommercial - CC BY 4.0

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More