Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 107 (Stable Set Problem) — Constraint detection

Given a graph with weighted vertices , the stable set problem is to find a subset of vertices of maximum weight , such that no two vertices in this subset are joined by an edge of the graph .

Problem 107 (Stable Set Problem) — Detection of the decisions and objects to be modeled

Given a graph with weighted vertices , the stable set problem is to find a subset of vertices of maximum weight , such that no two vertices in this subset are joined by an edge of the graph .

Back to list