An O(n2) time algorithm for the minimal permutation completion problem

Christophe Crespelle, Anthony Perez 0001, Ioan Todinca. An O(n2) time algorithm for the minimal permutation completion problem. Discrete Applied Mathematics, 254:80-95, 2019. [doi]

Abstract

Abstract is missing.