In the study of graph coloring problems in mathematics and computer science, a greedy coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings do not in general use the minimum number of colors possible; however they have been used in mathematics as a technique for proving other results about colorings and in computer science as a heuristic to find colorings with few colors.
Read more about Greedy Coloring: Greed Is Not Always Good, Optimal Ordering, Heuristic Ordering Strategies, Alternative Color Selection Schemes
Famous quotes containing the word greedy:
“The modern picture of The Artist began to form: The poor, but free spirit, plebeian but aspiring only to be classless, to cut himself forever free from the bonds of the greedy bourgeoisie, to be whatever the fat burghers feared most, to cross the line wherever they drew it, to look at the world in a way they couldn’t see, to be high, live low, stay young forever—in short, to be the bohemian.”
—Tom Wolfe (b. 1931)