Algorithmic and hardness results for the colorful components problems (Q747623)
From MaRDI portal
(Redirected from Item:Q5405083)
scientific article; zbMATH DE number 6276049
- Algorithmic and Hardness Results for the Colorful Components Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic and hardness results for the colorful components problems |
scientific article; zbMATH DE number 6276049 |
|
Statements
Algorithmic and hardness results for the colorful components problems (English)
0 references
Algorithmic and Hardness Results for the Colorful Components Problems (English)
0 references
19 October 2015
0 references
31 March 2014
0 references
colorful components
0 references
graph coloring
0 references
exact polynomial-time algorithms
0 references
hardness of approximation
0 references
