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 metadatas

https://hal.inria.fr/hal-01242028
Contributor : Christophe Crespelle <>
Submitted on : Friday, December 11, 2015 - 12:41:41 PM
Last modification on : Wednesday, January 23, 2019 - 7:48:12 PM

Identifiers

  • HAL Id : hal-01242028, version 1

Citation

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⟩

Share

Metrics

Record views

196