maximum stable set problem
Description: The maximum stable set problem seeks a largest set of pairwise nonadjacent vertices in a graph, a problem in combinatorial optimization.
Primary topic: Complexity and Algorithms in Graphs (36%)
OpenAlex ID: keywords/maximum-stable-set-problem
