Maximum Weight Independent Set Problem: Difference between revisions
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
* [[Algorithms#Dynamic_Programming_Algorithms|Dynamic Programming Algorithms]] | * [[Algorithms#Dynamic_Programming_Algorithms|Dynamic Programming Algorithms]] | ||
=Overview= | =Overview= | ||
=The Maximum Weight Independent Set Problem= | |||
Revision as of 19:26, 27 October 2021
External
- https://www.coursera.org/learn/algorithms-greedy/lecture/t9XAF/wis-in-path-graphs-optimal-substructure
- https://www.coursera.org/learn/algorithms-greedy/lecture/w040v/wis-in-path-graphs-a-linear-time-algorithm