An $O(n^2)$ time algorithm for the minimal permutation completion problem
| Origin | Files produced by the author(s) |
|---|
Journal Articles
Discrete Applied Mathematics
Year : 2019
Accord Elsevier CCSD : Connect in order to contact the contributor
https://inria.hal.science/hal-01969498
Submitted on : Thursday, October 21, 2021-9:44:25 PM
Last modification on : Monday, December 9, 2024-3:33:47 AM
Long-term archiving on : Saturday, January 22, 2022-9:21:16 PM
Dates and versions
Licence
Identifiers
- HAL Id : hal-01969498 , version 1
- DOI : 10.1016/j.dam.2018.06.036
- PII : S0166-218X(18)30398-6
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⟩
Collections
95
View
67
Download