An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090)
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 \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem |
scientific article; zbMATH DE number 6244010
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem |
scientific article; zbMATH DE number 6244010 |
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
