Greedy coloring (nonfiction): Difference between revisions
Jump to navigation
Jump to search
(Created page with "File:Greedy_colorings.svg|thumb|Two greedy colorings of the same graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, wh...") |
No edit summary |
||
| Line 1: | Line 1: | ||
[[File:Greedy_colorings.svg|thumb|Two greedy colorings of the same graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the greedy algorithm expends n/2 colors.]]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. | [[File:Greedy_colorings.svg|thumb|Two greedy colorings of the same graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the [[Greedy algorithm (nonfiction)|greedy algorithm]] expends n/2 colors.]]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. | ||
== In the News == | == In the News == | ||
| Line 15: | Line 15: | ||
== Nonfiction cross-reference == | == Nonfiction cross-reference == | ||
* [[Graph theory (nonfiction)]] | |||
* [[Greedy algorithm (nonfiction)]] | |||
* [[Mathematics (nonfiction)]] | * [[Mathematics (nonfiction)]] | ||
Revision as of 10:48, 3 September 2018
Two greedy colorings of the same graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the greedy algorithm expends n/2 colors.
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.
In the News
Fiction cross-reference
Nonfiction cross-reference
External links:
- Greedy coloring @ Wikipedia