Difference between revisions of "TADM2E 5.15"

From Algorithm Wiki
Jump to: navigation, search
(Blanked the page)
Line 1: Line 1:
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.
 

Revision as of 06:28, 16 July 2020