File:Greedy colorings.svg: Difference between revisions

From Gnomon Chronicles
Jump to navigation Jump to search
No edit summary
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
Nonfiction: Two [[Greedy coloring (nonfiction)|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.
Nonfiction: Two [[Greedy coloring (nonfiction)|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 ==
== Attribution ==


<gallery>
By Thore Husfeldt - Own work, CC BY-SA 3.0, https://commons.wikimedia.org/w/index.php?curid=5399420
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.
</gallery>
 
== Fiction cross-reference ==
 
* [[Crimes against mathematical constants]]
* [[Gnomon algorithm]]
* [[Gnomon Chronicles]]
* [[Mathematics]]
 
== Nonfiction cross-reference ==
 
* [[Greedy coloring (nonfiction)]]
* [[Mathematics (nonfiction)]]
 
External links:
 
* [https://en.wikipedia.org/wiki/Greedy_coloring Greedy coloring] @ Wikipedia
 
Attribution: By Thore Husfeldt - Own work, CC BY-SA 3.0, https://commons.wikimedia.org/w/index.php?curid=5399420


[[Category:Nonfiction (nonfiction)]]
[[Category:Nonfiction (nonfiction)]]

Latest revision as of 10:18, 2 April 2022

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.

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