TADM2E 5.16

From Algorithm Wiki
Revision as of 14:36, 23 July 2020 by Matt (talk | contribs) (Undo revision 786 by FuckYou (talk))
Jump to: navigation, search
  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.