Difference between revisions of "TADM2E 5.15"
From Algorithm Wiki
(Undo revision 809 by Hdyldhdlgzos (talk)) |
|
| (One intermediate revision by one other user not shown) | |
(No difference)
| |
Latest revision as of 15:58, 23 July 2020
To build a vertex cover, we need to keep at least one vertex for each edge. The independent set requires at most one vertex for each edge.
Together it means we need to keep only exactly one vertex for each edge, this reduces to two-colour graph problem.
