Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
theoretical computer science |
| gptkbp:application |
scheduling
register allocation frequency assignment |
| gptkbp:complexity |
NP-complete for k >= 3
|
| gptkbp:defines |
Given a graph and an integer k, determine if the graph's vertices can be colored with k colors so that no two adjacent vertices share the same color.
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:hasSpecialCase |
graph coloring problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
k-coloring problem
|
| gptkbp:relatedTo |
graph coloring
vertex coloring |
| gptkbp:solvedBy |
greedy algorithms
backtracking algorithms constraint satisfaction methods |
| gptkbp:bfsParent |
gptkb:3-coloring_problem
|
| gptkbp:bfsLayer |
7
|