An $O(n^2)$-time algorithm for the minimal permutation completion problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

An $O(n^2)$-time algorithm for the minimal permutation completion problem

Christophe Crespelle
  • Function : Author
  • PersonId : 929752
Dynamic Networks : Temporal and Structural Capture Approach
Anthony Perez
Laboratoire d'Informatique Fondamentale d'Orléans
Ioan Todinca
  • Function : Author
  • PersonId : 834333
Laboratoire d'Informatique Fondamentale d'Orléans

Domains

Computer Science [cs]

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, April 4, 2024-9:18:52 PM

No file

Dates and versions

hal-01242028 , version 1 (11-12-2015)

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

ENS-LYON UNIV-LYON3 UGA CNRS INRIA UNIV-LYON1 UNIV-LYON2 UNIV-ORLEANS INSA-LYON INRIA2 INSA-GROUPE INSA-CVL UDL
93 View
0 Download

Share

Gmail Facebook X LinkedIn More