HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
Document type :
Conference papers
Complete list of metadata

Contributor : Christophe Crespelle Connect in order to contact the contributor
Submitted on : Friday, December 11, 2015 - 12:41:41 PM
Last modification on : Friday, February 4, 2022 - 3:08:50 AM


  • HAL Id : hal-01242028, version 1


Christophe Crespelle, Anthony Perez, Ioan Todinca. An $O(n^2)$-time algorithm for the minimal permutation completion problem. 41st International Workshop on Graph-Theoretic Concepts in Computer Science - WG 2015, 2015, Munich, Germany. ⟨hal-01242028⟩



Record views