Most classic problems remain NP-hard on relative neighborhood graphs and their relatives (Q6544087)
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 7853701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Most classic problems remain NP-hard on relative neighborhood graphs and their relatives |
scientific article; zbMATH DE number 7853701 |
Statements
Most classic problems remain NP-hard on relative neighborhood graphs and their relatives (English)
0 references
27 May 2024
0 references
proximity graphs
0 references
relatively closest graphs
0 references
gabriel graphs
0 references
3-colorability
0 references
dominating set
0 references
feedback vertex set
0 references
Hamiltonian cycle
0 references
independent set
0 references
exponential-time hypothesis
0 references
