File:Greedy colorings.svg: Difference between revisions

From Gnomon Chronicles
Jump to navigation Jump to search
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

Fiction cross-reference

Nonfiction cross-reference

External links:

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/TimeThumbnailDimensionsUserComment
current09:47, 3 September 2018Thumbnail for version as of 09:47, 3 September 2018303 × 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 == <...

Metadata