An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem (Q3569074)
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 interval completion problem |
scientific article; zbMATH DE number 5723179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem |
scientific article; zbMATH DE number 5723179 |
Statements
An ${\mathcal{O}}(n^2)$ -time Algorithm for the Minimal Interval Completion Problem (English)
0 references
17 June 2010
0 references
0.987039029598236
0 references
0.9220037460327148
0 references
0.9048610329627992
0 references
0.9014285802841188
0 references
0.8735278248786926
0 references
