Difference between revisions of "TADM2E 5.16"

From Algorithm Wiki
Jump to: navigation, search
(Undo revision 786 by FuckYou (talk))
(Blanked the page)
Line 1: Line 1:
# This translates to the question of labeling the tree with two colors, because this way each edge's vertices are colored differently. The larger group of colors is the sought for maximum-size independent set.
+
 

Revision as of 09:36, 31 July 2020