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

Christophe Crespelle, Anthony Perez, Ioan Todinca (2019)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2018.06.036

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/Crespelle0T19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Crespelle0T19
Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n2) time algorithm for the minimal permutation completion problem. Discret. Appl. Math. 254: 80-95 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.