Maximum Weight Independent Set Problem: Difference between revisions
Jump to navigation
Jump to search
| Line 10: | Line 10: | ||
=The Maximum Weight Independent Set Problem= | =The Maximum Weight Independent Set Problem= | ||
Given a [[Graph_Concepts#Path_Graph|path graph]] G=(V, E) where V consists in a set of vertices v<sub>0</sub>, v<sub>1</sub> ... v<sub>n-1</sub> that form a path, each of vertices with its own positive weight w<sub>i</sub>, compute a maximum weight [[Graph_Concepts#Independent_Set|independent set]] of the graph, which means a set of vertices in which none is [[Graph_Concepts#Vertex_Adjacency|adjacent]] to the other. | |||
Revision as of 21:21, 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
- https://www.coursera.org/learn/algorithms-greedy/lecture/TZgJM/wis-in-path-graphs-a-reconstruction-algorithm
Internal
Overview
This article introduces the maximum weight independent set of a path graph and provides a dynamic programming algorithm to solve it.
The Maximum Weight Independent Set Problem
Given a path graph G=(V, E) where V consists in a set of vertices v0, v1 ... vn-1 that form a path, each of vertices with its own positive weight wi, compute a maximum weight independent set of the graph, which means a set of vertices in which none is adjacent to the other.