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

Christophe Crespelle; Anthony Perez; Ioan Todinca

doi:10.1016/j.dam.2018.06.036

Journal Articles Discrete Applied Mathematics Year : 2019

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

(1) , (2) , (2)

1
2

Christophe Crespelle

Function : Author
PersonId : 929752

Dynamic Networks : Temporal and Structural Capture Approach

Anthony Perez

Function : Author
PersonId : 8011
IdHAL : anthony-perez
IdRef : 164251014

Graphes, Algorithmes et Modèles de Calcul

Ioan Todinca

Function : Author
PersonId : 834333

Graphes, Algorithmes et Modèles de Calcul

Domains

Computer Science [cs] Data Structures and Algorithms [cs.DS]

Fichier principal

S0166218X18303986.pdf (538.53 Ko)

Origin : Files produced by the author(s)

Accord Elsevier CCSD : Connect in order to contact the contributor

https://hal.inria.fr/hal-01969498

Submitted on : Thursday, October 21, 2021-9:44:25 PM

Last modification on : Tuesday, October 25, 2022-4:23:01 PM

Long-term archiving on: Saturday, January 22, 2022-9:21:16 PM

Dates and versions

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

Licence

Attribution - NonCommercial - CC BY 4.0

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

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

72 View

31 Download

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

Domains

Dates and versions

Licence

Identifiers

Cite

Export

Collections

Altmetric

Share