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
2 GAMoC - Graphes, Algorithmes et Modèles de Calcul

Domaines: Algorithme et structure de données [cs.DS]

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⟩