An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem |
scientific article |
Statements
An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (English)
0 references
10 January 2014
0 references
graph algorithms
0 references
interval graphs
0 references
minimal interval completions
0 references
