Difference between revisions of "TADM2E 5.16"
From Algorithm Wiki
(Replaced content with "TaDa"") |
|||
| 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 14:36, 23 July 2020
- 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.
