TADM2E 5.16

From Algorithm Wiki
Revision as of 01:02, 1 August 2020 by Matt (talk | contribs) (Undo revision 1061 by FuckMatt (talk))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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.