Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164)
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 7559377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Computing the Anti-Ramsey Numbers for Paths. |
scientific article; zbMATH DE number 7559377 |
Statements
18 July 2022
0 references
coloring
0 references
anti-Ramsey
0 references
approximation
0 references
NP-hard
0 references
algorithm
0 references
ETH
0 references
Complexity of Computing the Anti-Ramsey Numbers for Paths. (English)
0 references
0 references
0.88981354
0 references
0.8874723
0 references
0.88595444
0 references
0.88473403
0 references
0.8845379
0 references
