Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774)
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 7300876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and algorithms of equitable tree-coloring problem in chordal graphs |
scientific article; zbMATH DE number 7300876 |
Statements
Hardness and algorithms of equitable tree-coloring problem in chordal graphs (English)
0 references
25 January 2021
0 references
W[1]-hardness
0 references
linear-time algorithm
0 references
approximation algorithm
0 references
equitable tree-coloring
0 references
chordal graphs
0 references
0.9427303671836852
0 references
0.8248450756072998
0 references
0.8240341544151306
0 references
0.8235052227973938
0 references
