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
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.
Navigation menu
Personal tools
Create account
Log in
Namespaces
Page
Discussion
Variants
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help
Tools
What links here
Related changes
Special pages
Permanent link
Page information