Difference between revisions of "TADM2E 5.16"

From Algorithm Wiki
Jump to: navigation, search
(Recovering wiki)
(No difference)

Latest revision as of 18:13, 11 September 2014

  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.