stable set problem
Description: A graph optimization problem that seeks a largest set of vertices with no edges between any pair, often studied through integer programming and polyhedral methods.
Primary topic: Complexity and Algorithms in Graphs (40%)
OpenAlex ID: keywords/stable-set-problem
