An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n^2) time algorithm for the minimal permutation completion problem |
scientific article; zbMATH DE number 7018416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^2)\) time algorithm for the minimal permutation completion problem |
scientific article; zbMATH DE number 7018416 |
Statements
An \(O(n^2)\) time algorithm for the minimal permutation completion problem (English)
0 references
8 February 2019
0 references
permutation graph
0 references
minimal permutation completion
0 references
polynomial algorithm
0 references
0 references
0.9679804444313048
0 references
0.8199976086616516
0 references
0.819429337978363
0 references
0.7679891586303711
0 references
0.7663940191268921
0 references
