Given a set of vertices V that describes a path in a graph, with each vertex assigned a weight. Find a subset of V that maximizes the sum of vertex weights without any two vertices in that subset being adjacent.

Skip to content
# Routing and graph theory

From the dark forest