TADM2E 5.16 - Revision history

Matt: Undo revision 1061 by FuckMatt (talk)

2020-08-01T01:02:25Z

Undo revision 1061 by FuckMatt (talk)

FuckMatt: Blanked the page

2020-07-31T09:36:44Z

Blanked the page

Matt: Undo revision 786 by FuckYou (talk)

2020-07-23T14:36:00Z

Undo revision 786 by FuckYou (talk)

FuckYou: Replaced content with "TaDa""

2020-07-14T01:53:27Z

Replaced content with "TaDa""

Algowikiadmin: Recovering wiki

2014-09-11T18:13:48Z

Recovering wiki

New page

# 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.

← Older revision	Revision as of 01:02, 1 August 2020
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.

← Older revision		Revision as of 09:36, 31 July 2020
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.	+

← Older revision		Revision as of 14:36, 23 July 2020
Line 1:		Line 1:
−	~~TaDa"~~	+	# 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.

← Older revision		Revision as of 01:53, 14 July 2020
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.	+	TaDa"