Recognizing graphs with fixed interval number is NP-complete (Q760213): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:25, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing graphs with fixed interval number is NP-complete |
scientific article |
Statements
Recognizing graphs with fixed interval number is NP-complete (English)
0 references
1984
0 references
interval graph
0 references
NP-completeness
0 references
graph algorithm
0 references
interval representation
0 references
interval number
0 references
