File:Greedy colorings.svg: Difference between revisions
Line 5: | Line 5: | ||
<gallery> | <gallery> | ||
File:Greedy algorithm 36 cents.svg|link=Greedy algorithm (nonfiction)|2018: Consortium of [[Greedy algorithm (nonfiction)|Greedy algorithms]] found guilty of extorting a percentage of color (the so-called "color tax") from [[Greedy coloring (nonfiction)|greedy coloring]] algorithms worldwide. | File:Greedy algorithm 36 cents.svg|link=Greedy algorithm (nonfiction)|2018: Consortium of [[Greedy algorithm (nonfiction)|Greedy algorithms]] found guilty of extorting a percentage of color (the so-called "color tax") from [[Greedy coloring (nonfiction)|greedy coloring]] algorithms worldwide. | ||
File:Greedy colorings.svg|link=Greedy coloring (nonfiction)|September 4, 1973: An experimental graph coloring model accidentally generates a [[Greedy coloring (nonfiction)|Greedy coloring]] computer virus which causes the color [[Green (nonfiction)|green]] to become [[Red (nonfiction)|red]] in the vicinity of every computer terminal around the world. The virus will be eliminated several hours later by [[Algorithmic Paradigm Treaty Organization|APTO]] troubleshooters, restoring [[Green (nonfiction)|green]] to its normal appearance. | |||
</gallery> | </gallery> | ||
Revision as of 12:32, 3 September 2018
Nonfiction: 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 News
2018: Consortium of Greedy algorithms found guilty of extorting a percentage of color (the so-called "color tax") from greedy coloring algorithms worldwide.
September 4, 1973: An experimental graph coloring model accidentally generates a Greedy coloring computer virus which causes the color green to become red in the vicinity of every computer terminal around the world. The virus will be eliminated several hours later by APTO troubleshooters, restoring green to its normal appearance.
Fiction cross-reference
Nonfiction cross-reference
External links:
- Greedy coloring @ Wikipedia
Attribution: By Thore Husfeldt - Own work, CC BY-SA 3.0, https://commons.wikimedia.org/w/index.php?curid=5399420
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 09:47, 3 September 2018 | 303 × 188 (9 KB) | Admin (talk | contribs) | Nonfiction: 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 News == <... |
You cannot overwrite this file.
File usage
The following 15 pages use this file:
- APTO Math Crimes Unit case files
- Algorithmic Paradigm Treaty Organization
- Blossom algorithm (nonfiction)
- Color commentator (nonfiction)
- Crimes against mathematical constants are more common than you think
- Graph theory (nonfiction)
- Greedy algorithm (nonfiction)
- Greedy coloring (nonfiction)
- Green (nonfiction)
- File:APTO logo.jpg
- File:Blossom with Edmonds matching algorithm.svg
- File:Color commentators.jpg
- File:Greedy algorithm 36 cents.svg
- File:Green Sprouts Gnomon Chronicles April 30 2018.png
- File:Six node graph.svg