Complexity of computation of some functions of graphs (Q3364155)
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 4217959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of computation of some functions of graphs |
scientific article; zbMATH DE number 4217959 |
Statements
1991
0 references
NP-hard
0 references
Hadwiger number
0 references
pseudo-achromatic number
0 references
0.765064001083374
0 references
0.7611486911773682
0 references
0.7602444291114807
0 references
