Recognizing graphs with fixed interval number is NP-complete (Q760213)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3883621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing graphs with fixed interval number is NP-complete |
scientific article; zbMATH DE number 3883621 |
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
0 references
0.8178104758262634
0 references
0.8064668774604797
0 references
0.8039085268974304
0 references
0.8028048872947693
0 references
0.8021570444107056
0 references
