An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6244010 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph algorithms | |||
| Property / zbMATH Keywords: graph algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
interval graphs | |||
| Property / zbMATH Keywords: interval graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimal interval completions | |||
| Property / zbMATH Keywords: minimal interval completions / rank | |||
Normal rank | |||
Revision as of 14:07, 29 June 2023
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
