Conference Papers
Year : 2015
Christophe Crespelle : Connect in order to contact the contributor
https://inria.hal.science/hal-01242028
Submitted on : Friday, December 11, 2015-12:41:41 PM
Last modification on : Thursday, May 11, 2023-11:56:12 AM
Dates and versions
Identifiers
- HAL Id : hal-01242028 , version 1
Cite
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⟩
Collections
91
View
0
Download