An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2012.12.031 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2012.12.031 / rank | |||
Normal rank | |||
Revision as of 00:50, 9 December 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
0 references
